practice a little every day, paws crossed ♡
Software Engineer Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 1141–1170 of 2629 results
- IBMEasySoftware EngineerCalculate Revenue from Highest-Inventory VM Sales
Sell each VM unit at its current inventory count, always choose a type with maximum inventory, and compute total revenue safely.
Coding & AlgorithmsOnline Assessment - IBMMediumSoftware EngineerCount Employees With Unbroken Renewable Access at the Last Timestamp
A simulation problem about an access system where each employee's access lasts a fixed duration after every setting and can be extended only while it is still active. It asks how many employees hold valid access at the last timestamp, testing exact expiry boundaries, permanent lapses and per-employee state.
Coding & AlgorithmsTechnical Screen - IBMMediumSoftware EngineerCount Index Triplets Whose Max Minus Min Is at Most d
A counting problem that asks how many triplets of positions in an integer array have a spread, the largest value minus the smallest, of at most d. It tests handling duplicates and inclusive bounds, producing a count that can exceed 32 bits, and meeting time limits for arrays of up to 100,000 elements.
Coding & AlgorithmsTechnical Screen - IBMMediumSoftware EngineerCount Replacements Needed to Separate Equal Adjacent Characters
This problem tests your ability to identify and process consecutive character runs in strings and apply greedy calculations to minimize replacement operations.
Coding & AlgorithmsOnline AssessmentGreedyStringsArray - IBMMediumSoftware EngineerCount Seat-Price Trios Within a Budget Spread
Count how many trios of resale-marketplace seat listings have prices within a fixed budget spread of each other, using sorting and a two-pointer sweep instead of an O(n^3) scan.
Coding & AlgorithmsTechnical Screensortingtwo-pointerscombinatorics - IBMMediumSoftware EngineerCount Sensor Trios Within a Tolerance Band
Count how many groups of three readings stay inside a tolerance band (max minus min within a limit). Tests sorting, a sliding window, combinatorial counting and handling of duplicates and large totals.
Coding & AlgorithmsTechnical Screensortingtwo-pointerscombinatorics - IBMMediumSoftware EngineerCount Tree Vertices with Pythagorean Distances
Calculate distances from three fixed vertices to all other vertices in an unweighted tree and count those whose strictly positive distances form a Pythagorean triple.
Coding & AlgorithmsOnline AssessmentTreesBFSGraph - IBMMediumSoftware EngineerFind minimum subarray length with k distinct integers
This question tests proficiency with the sliding window technique and hash map-based frequency tracking, applied to subarray problems requiring exact cardinality constraints. It assesses the ability to distinguish between "exactly k distinct" and "at most k distinct" variants — a nuance that reveals depth in algorithmic thinking commonly evaluated in software engineering interviews.
Coding & AlgorithmsTechnical Screen - IBMMediumSoftware EngineerFunction Signature Lookup with Exact and Variadic Parameter Matching
A coding question about an IDE-style signature lookup engine: given registered functions, some whose last parameter is variadic, return for each call the sorted names of every function that accepts its argument types. It tests exact type-sequence matching, zero-or-more variadic arguments and edge cases such as empty argument lists.
Coding & AlgorithmsTechnical Screen - IBMMediumSoftware EngineerManage Authentication Tokens with a Fixed Time to Live
Design an authentication token manager that handles token generation, renewal, and active token counting based on a fixed time-to-live.
Coding & AlgorithmsOnline AssessmentHash MapDesignQueue - IBMMediumSoftware EngineerMaximize Revenue from Depleting VM Inventory
This problem tests your ability to efficiently manage and update a dynamic collection of items using a priority queue to always extract the maximum value.
Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization - IBMMediumSoftware EngineerMaximize Revenue from Depleting VM Stock
Tests greedy optimization, sorting, and arithmetic progression math to compute maximum revenue from diminishing-value stock with large order quantities.
Coding & AlgorithmsOnline Assessmentgreedybinary-searchmath - IBMMediumSoftware EngineerMaximize palindromic strings after character swaps
This question evaluates proficiency in string manipulation, combinatorial character-count reasoning, and redistribution of characters under constrained swap operations within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - IBMEasySoftware EngineerSum Pairwise Remainders Across Two Integer Ranges
Calculate the total sum of remainders obtained by taking each integer in a dividend range modulo each non-zero divisor in a divisor range. The problem tests division properties, edge-case handling for zero divisors, and avoiding integer overflow.
Coding & AlgorithmsOnline AssessmentMathAlgorithmsArithmetic - IBMEasySoftware EngineerSum the XOR of Every Cross-Array Pair
Tests bitwise frequency analysis and arithmetic optimization by reducing an O(N * M) cross-product XOR sum to an O(B * (N + M)) bit-by-bit contribution calculation.
Coding & AlgorithmsOnline Assessmentbit-manipulationmatharrays - IXL LearningMediumSoftware EngineerFind value on most distinct levels
This question evaluates a candidate's understanding of binary tree structures, level-wise aggregation and frequency analysis, along with algorithm design and complexity reasoning.
Coding & AlgorithmsTechnical Screen - IXL LearningMediumSoftware EngineerIdentify and prevent code-breaking inputs
Identify and prevent code-breaking inputs evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - IXL LearningHardSoftware EngineerMaintain a Stream Median
This question tests the ability to maintain dynamic order statistics in a streaming context, requiring an efficient way to insert elements and compute the median in logarithmic time.
Coding & AlgorithmsTechnical ScreenHeapsData StructuresAlgorithms - IXL LearningMediumSoftware EngineerSolve snake game, peak search, and task scheduling
Solve snake game, peak search, and task scheduling evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - IllumioMediumSoftware EngineerCount Regions in a Binary Grid
This problem tests your ability to navigate a 2D grid and identify connected components using graph traversal techniques like Depth-First Search (DFS) or Breadth-First Search (BFS).
Coding & AlgorithmsOnsiteDFSBFSGraph - IllumioMediumSoftware EngineerSolve Matrix Traversal and Pair Sum
This problem tests your ability to manipulate 2D matrix indices for spiral traversal and apply efficient hash-based lookups to solve the two-sum problem within a specific sequence.
Coding & AlgorithmsOnsiteMatrixArrayHash Table - ImbueHardSoftware EngineerMax Score of an Alternating Left-Right Walk Over a Row of Signed Cells
A token walks a row of up to 50 signed cells, alternating right and left moves, and each move adds the sum of the cells it covers while the score must never drop below zero. Find the best score within up to 400 million moves, testing state design, the non-negative score constraint, and speed when the move count is huge.
Coding & AlgorithmsHR Screen - ImcHardSoftware EngineerChoose container set to minimize waste
An IMC software engineer take-home asking you to pick the single container set that fulfills all medicine orders with minimum total waste. It tests ceiling-style binary search, per-set validity checks, smallest-index tie-breaking, and efficient handling of inputs up to 10^5 to avoid an O(n*T) timeout.
Coding & AlgorithmsOnline Assessment - ImcMediumSoftware EngineerFind k-th recipient in command propagation order
This question evaluates understanding of tree traversals, subtree indexing, and order-statistics on rooted trees, focusing on DFS-preorder propagation when children are visited in ascending id.
Coding & AlgorithmsOnline Assessment - IndeedMediumSoftware EngineerImplement Get and Insert in an Unrolled Linked List
Implement indexed get and insert in an unrolled linked list, preserving block capacity, occupancy, sequence order, and split behavior.
Coding & AlgorithmsTechnical Screen - InstacartMediumSoftware EngineerBuild a Progressive Banking System
This problem tests your ability to manage state transitions, handle expiring reservations, and maintain consistent ledger balances across multiple accounts.
Coding & AlgorithmsTechnical ScreenHash MapState ManagementTransaction Processing - InstacartMediumSoftware EngineerCalculate a Basket Total from Delimited Product Records
Parse pipe-delimited shopping cart records to compute the total basket cost in integer cents, properly accumulating repeated SKUs and handling zero-quantity items.
Coding & AlgorithmsOnsitestringsparsinghash-table - InstacartMediumSoftware EngineerCompute and optimize average wait time
This question evaluates skills in scheduling and queueing algorithms, simulation of service systems, and reasoning about time and space complexity when computing average waiting times.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerCompute average customer waiting time
Compute average customer waiting time evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerCompute delivery wait times
This question evaluates competence in event-driven simulation, scheduling and queueing concepts, and algorithmic analysis by requiring computation of average customer waiting time for single and multiple shoppers.
Coding & AlgorithmsOnsite
IBM
IXL Learning
Imc
Indeed
Instacart