practice a little every day, paws crossed ♡
Coding & Algorithms 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 1411–1440 of 3276 results
- InstacartMediumSoftware EngineerImplement timestamped task management system APIs
This question evaluates a candidate's ability to design and implement time-ordered in-memory data structures and APIs, testing competencies in temporal event ordering and precedence, scheduled deletions, priority-sorted retrieval, user-task assignment, and historical (time-travel) queries.
Coding & AlgorithmsOnline Assessment - InstacartHardSoftware EngineerImplement worker time and payroll tracker
This problem tests your ability to manage overlapping time intervals, perform efficient lookups on historical state changes, and calculate cumulative payroll based on dynamic shift rates.
Coding & AlgorithmsOnline AssessmentIntervalsBinary SearchData Structures - InstacartMediumSoftware EngineerOptimize file reading and expression DFS
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Optimize file reading and expression DFS states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsHR Screen - InstacartMediumSoftware EngineerOptimize file reads for password validation
This question evaluates proficiency in on-disk file I/O, streaming algorithms, offline indexing for sublinear lookups, and system-level performance considerations for validating credentials in large files.
Coding & AlgorithmsHR Screen - InstacartMediumSoftware EngineerParse a password from a matrix
This question evaluates proficiency in grid traversal, sequence-driven state tracking, string manipulation, and boundary/obstacle validation while requiring time and space complexity reasoning.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerParse password from indexed matrix file
This question evaluates file parsing, matrix indexing with a specified coordinate origin, handling multiple indexed blocks, and string assembly into an ordered password, testing competencies in file I/O, coordinate transformations, and robust input handling.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerPivot order-status counts
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Pivot order-status counts states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerResolve a Variable Through Literal and Reference Assignments
Resolve a target variable through an acyclic chain of named assignments until reaching an integer literal, independent of definition order.
Coding & AlgorithmsOnsite - InstacartHardMachine Learning EngineerSolve Two Sorted-Array Tasks
This problem tests your ability to efficiently merge and find elements in sorted arrays, focusing on optimal time complexity and edge case handling.
Coding & AlgorithmsTechnical ScreenArraysBinary SearchTwo Pointers - InstacartMediumSoftware EngineerSolve bank, password, expression algorithm tasks
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve bank, password, expression algorithm tasks states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - InstacartMediumSoftware EngineerSolve expression evaluator and string decoder
This question evaluates a candidate's ability in parsing, expression evaluation, and nested string decoding, including handling malformed input, character encoding nuances, and large-file streaming considerations.
Coding & AlgorithmsOnsite - Interactive BrokersMediumSoftware EngineerCalculate Tax Under Progressive Income Brackets
This problem tests the ability to iterate through sorted intervals and calculate values based on overlapping ranges, requiring careful boundary handling.
Coding & AlgorithmsOnline AssessmentArraysSimulationGreedy - Interactive BrokersEasySoftware EngineerCalculate Tax in a Progressive Marginal Tax System
Practice a Interactive Brokers coding interview problem focused on calculate tax in a progressive marginal tax system. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Coding & AlgorithmsOnline Assessment - Interactive BrokersMediumData EngineerCompute Minimum Production Days
A data engineering coding screen on greedy scheduling under a cooldown constraint: produce an ordered list of products, one per day, where each product type must cool down for `space` days before it can be produced again. Candidates must return the minimum number of days, ideally in O(n) time using a hash map of last-produced days.
Coding & AlgorithmsTechnical Screen - IntersystemsEasySoftware EngineerFind the longest palindromic substring
This question evaluates string manipulation and algorithmic problem-solving skills, focusing on identifying palindromic substrings and reasoning about performance and edge cases. Commonly asked in the Coding & Algorithms domain to assess practical algorithmic application, it gauges understanding of time/space complexity, input constraints, and robustness in implementation.
Coding & AlgorithmsTechnical Screen - IntersystemsMediumSoftware EngineerMeasure 45 minutes with two ropes
This problem tests creative logical reasoning and the ability to decompose time-based tasks into parallelizable components without standard measurement tools.
Coding & AlgorithmsTechnical ScreenLogicPuzzlesAlgorithms - IntersystemsMediumSoftware EngineerPredict output when iterating ordered keys
This problem tests your understanding of ordered map iteration, the impact of modifying collection traversal, and handling accumulation logic in a state-dependent loop.
Coding & AlgorithmsTechnical ScreenData StructuresAlgorithmsIteration - IntuitEasySoftware EngineerAdd One to Digit Array
This problem tests your ability to handle array-based arithmetic and carry-over logic, specifically focusing on edge cases like digit overflow and resizing the array.
Coding & AlgorithmsTechnical ScreenArrayMathSimulation - IntuitHardSoftware EngineerFind Business Degrees of Separation
This question evaluates understanding of graph traversal and shortest-path computation, including modeling business relationships as undirected graphs and interpreting degrees of separation on the shortest path.
Coding & AlgorithmsTechnical Screen - IntuitMediumSoftware EngineerFind largest filename from ls -l output
This question evaluates proficiency in text parsing, tokenization, and numeric comparison applied to command-line style output, emphasizing robust handling of varied input formats and edge cases.
Coding & AlgorithmsOnline Assessment - IntuitMediumSoftware EngineerImplement LRU, Extend to LFU, Analyze Complexity
This question evaluates understanding of cache eviction policies (LRU and LFU), frequency tracking, and the design of data structures that support efficient get/put operations while meeting time and space complexity constraints.
Coding & AlgorithmsTechnical Screen - IntuitMediumSoftware EngineerIncrement a Digit-Array Integer by One
This problem tests your ability to perform manual addition on an array representing a large integer, specifically handling carry propagation and dynamic resizing when the integer overflows its current digit count.
Coding & AlgorithmsTechnical ScreenArraysMathAlgorithms - IntuitMediumSoftware EngineerProduce valid student lineup from parent array
This problem tests your ability to reconstruct a valid topological ordering (parent-before-child) from a parent-child relationship array while maintaining lexicographical minimality.
Coding & AlgorithmsOnline AssessmentGraphsTreesPriority Queue - IntuitMediumSoftware EngineerSolve word segmentation and React palindrome validation
This question evaluates competencies in string algorithms (word segmentation and palindrome validation), data structures and complexity analysis, and practical frontend React implementation with performance considerations.
Coding & AlgorithmsTechnical Screen - IntuitMediumSoftware EngineerSum palindrome-change costs over all substrings
This question evaluates understanding of string algorithms, combinatorial counting, and algorithmic optimization for aggregating pairwise mismatch costs across all substrings.
Coding & AlgorithmsOnline Assessment - IntuitEasySoftware EngineerValidate bracket sequence
This question evaluates understanding of bracket matching and string parsing, testing competency with basic data structures and algorithmic reasoning such as stack-based matching and correct handling of nested delimiters.
Coding & AlgorithmsTechnical Screen - IxanaHardSoftware EngineerSchedule batched register operations optimally
This question evaluates scheduling and ordering under timing constraints, read-after-write hazards, intra-batch dependency handling, and the ability to parse and execute register read/write operations.
Coding & AlgorithmsTechnical Screen - J.P. MorganMediumSoftware EngineerCan All Courses Be Completed?
This problem tests your ability to detect cycles in a directed graph to determine if a set of dependent tasks can be successfully completed.
Coding & AlgorithmsTechnical ScreenGraphDFSBFS - J.P. MorganMediumSoftware EngineerCompute longest palindromic subsequence
This question evaluates understanding of dynamic programming for strings, specifically longest palindromic subsequence concepts such as memoization, bottom-up DP, space optimization and subsequence reconstruction.
Coding & AlgorithmsOnsite - J.P. MorganMediumSoftware EngineerCompute ring window max and deletion indices
This question evaluates algorithmic problem-solving across arrays and strings, covering concepts such as sliding-window techniques on circular arrays, wraparound handling, index recovery after single-character deletion, duplicate-character considerations, and time/space complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen
Instacart
Intuit
J.P. Morgan