Coding & Algorithms interview questions

Showing 1381–1410 of 3276 results

• Find value on most distinct levelsMedium

  This question evaluates a candidate's understanding of binary tree structures, level-wise aggregation and frequency analysis, along with algorithm design and complexity reasoning.

  IXL LearningSoftware EngineerCoding & AlgorithmsTechnical Screen
• Identify and prevent code-breaking inputsMedium

  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.

  IXL LearningSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maintain a Stream MedianHard

  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.

  IXL LearningSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve snake game, peak search, and task schedulingMedium

  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.

  IXL LearningSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Regions in a Binary GridMedium

  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).

  IllumioSoftware EngineerCoding & AlgorithmsOnsite
• Solve Matrix Traversal and Pair SumMedium

  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.

  IllumioSoftware EngineerCoding & AlgorithmsOnsite
• Max Score of an Alternating Left-Right Walk Over a Row of Signed CellsHard

  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.

  ImbueSoftware EngineerCoding & AlgorithmsHR Screen
• Choose container set to minimize wasteHard

  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.

  ImcSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find k-th recipient in command propagation orderMedium

  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.

  ImcSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Get and Insert in an Unrolled Linked ListMedium

  Implement indexed get and insert in an unrolled linked list, preserving block capacity, occupancy, sequence order, and split behavior.

  IndeedSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Progressive Banking SystemMedium

  This problem tests your ability to manage state transitions, handle expiring reservations, and maintain consistent ledger balances across multiple accounts.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate a Basket Total from Delimited Product RecordsMedium

  Parse pipe-delimited shopping cart records to compute the total basket cost in integer cents, properly accumulating repeated SKUs and handling zero-quantity items.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Compute and optimize average wait timeMedium

  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.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Compute average customer waiting timeMedium

  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.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Compute delivery wait timesMedium

  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.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Decode a password string into lettersHard

  This problem tests your ability to parse and reconstruct a string based on specific numeric encoding rules, requiring careful index tracking and stack-based or recursive logic.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Decode an encoded stringMedium

  This question evaluates string parsing and manipulation skills, particularly handling nested repetition encodings and managing state when expanding bracketed substrings.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate Ordered Variable Definitions with Addition and SubtractionEasy

  Evaluate ordered variable definitions and plus/minus expressions with an explicit directional grammar, while distinguishing assignment lookup from general equation solving.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Evaluate an arithmetic expressionMedium

  This question tests the ability to evaluate a mathematical string containing integers, addition, subtraction, multiplication, and division, requiring an understanding of operator precedence and the use of stacks.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate arithmetic expression using DFSMedium

  This question evaluates a candidate's understanding of expression parsing and evaluation using depth-first traversal, covering competencies in recursive descent or stack-based DFS, operator precedence, unary operators, and 64-bit integer division semantics with truncation toward zero.

  InstacartSoftware EngineerCoding & AlgorithmsHR Screen
• Evaluate arithmetic expression with precedenceMedium

  Instacart software-engineer onsite coding question: implement an arithmetic expression evaluator for a string of non-negative integers, +, -, *, /, parentheses, and spaces. It tests operator precedence and associativity, unary minus, 64-bit intermediates, integer division truncating toward zero, and robust handling of invalid input via a two-stack, shunting-yard, or recursive-descent parser.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Evaluate dependent variable expressionsMedium

  This question evaluates a candidate's ability to parse and evaluate assignment expressions, resolve inter-variable dependencies, and detect cycles or unsolvable references.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Evaluate query ratios from equationsHard

  This problem tests your ability to model algebraic relationships as a weighted directed graph and perform pathfinding to calculate ratios between variables.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fix the Broken Search Filter in a Book Catalog APIMedium

  This problem tests your ability to sanitize inputs and implement robust filtering logic on a collection of structured objects using multiple criteria.

  InstacartBackend EngineerCoding & AlgorithmsOnline Assessment
• Implement an In-Memory File Storage SystemMedium

  This question evaluates the ability to design and implement efficient in-memory data structures and algorithms for stateful file management, covering string-keyed storage, size accounting, querying and sorting, and user quota enforcement.

  InstacartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement bus route simulation featuresMedium

  This question evaluates a candidate's skills in stateful event-driven simulation, data-structure and algorithm design for capacity-constrained boarding and dropping logic, and statistical downsampling to preserve origin–destination demand distributions.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Implement matrix-indexing and expression resolverMedium

  This question evaluates a candidate's ability to parse structured text files, perform matrix indexing with a nonstandard origin convention, reconstruct data across multiple blocks, and resolve symbolic variable expressions and dependencies for arithmetic evaluation in the Coding & Algorithms domain.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite
• Implement multiple coding round problemsMedium

  This problem tests your ability to manage a time-sensitive priority queue, handle dynamic variable substitution in expressions, and optimize for streaming data processing.

  InstacartSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement prefix and suffix file searchMedium

  This question evaluates the ability to design and implement efficient string-indexing data structures and APIs for prefix-and-suffix matching, demonstrating competency with tries, suffix-related structures, inverted indexes, and time/space complexity trade-offs.

  InstacartSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement store, evaluator, and parserHard

  This problem tests your ability to design a robust in-memory data store with versioning and TTL, implement an expression evaluator for dependencies, and parse a specialized stream of matrix data.

  InstacartSoftware EngineerCoding & AlgorithmsOnsite