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 721–750 of 1706 results
- 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 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 - 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 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 - J.P. MorganMediumSoftware EngineerCount requests dropped when incoming requests exceed available server threads
Simulate a server that receives thread additions and incoming requests as an integer array, where each request permanently consumes one available thread or is dropped, and return how many requests are dropped. It tests careful single-pass array simulation, event ordering, and awareness of integer overflow.
Coding & AlgorithmsTechnical Screen - J.P. MorganEasySoftware EngineerCount substrings and generate TOC
This question evaluates string processing, pattern recognition, and parsing competencies—covering counting and grouping in binary substrings and structured line parsing and numbering for a table of contents—within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - J.P. MorganMediumData ScientistImplement Integer Square Root
This question evaluates numerical algorithm design and integer arithmetic competence, including robustness for edge cases and overflow handling, and is categorized in the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - J.P. MorganMediumData ScientistImplement KNN from Scratch
This problem tests your ability to implement the K-Nearest Neighbors (KNN) algorithm from scratch, focusing on distance computation, sorting, and majority voting logic.
Coding & AlgorithmsTechnical ScreenKNNSupervised LearningAlgorithms - J.P. MorganEasySoftware EngineerImplement an O(1) LRU Cache
This problem tests your ability to combine a hash map with a doubly linked list to achieve O(1) time complexity for cache operations.
Coding & AlgorithmsTechnical ScreenData StructuresHash MapLinked List - J.P. MorganMediumSoftware EngineerMerge Overlapping Intervals
This problem tests your ability to manipulate array-based data by identifying and merging intersecting ranges using a greedy sorting strategy.
Coding & AlgorithmsTechnical ScreenArraysSortingGreedy - J.P. MorganMediumMachine Learning EngineerReturn Every Index Pair Whose Values Sum to a Target
This problem tests your ability to handle frequency counts and index tracking using hash maps to identify all possible index pairs that sum to a specific target, particularly in the presence of duplicate values.
Coding & AlgorithmsTechnical ScreenHash MapArraysAlgorithms - Jane StreetMediumMachine Learning EngineerBoard Simulation: Bottom-Insert Pieces with Uniform Row and Column Detection
This question evaluates the ability to simulate a 2-D game board and maintain dynamic state invariants, testing array manipulation, state-tracking, and detection of uniform rows and columns under bottom-insert semantics.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumSoftware EngineerBottom-Insertion Connect Game: Detect the First k-in-a-Row Winner
This question evaluates simulation and algorithmic problem-solving skills, focusing on state maintenance for an unbounded grid, efficient detection of k-in-a-row runs in rows and columns, and handling column-wise shifts that can produce simultaneous winners.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumMachine Learning EngineerCode Editor with Block Shrink and Expand (Code Folding)
This question evaluates a candidate's ability to model and manipulate indentation-based hierarchical structures, maintain nested visibility state for collapsed blocks, and map between original file lines and dynamic display numbering.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumMachine Learning EngineerConnect-N on an Infinite Board with Gravity
This question evaluates implementation skills for efficient algorithms and data structures to manage a sparse, unbounded grid with gravity and to detect N-in-a-row runs both vertically and horizontally.
Coding & AlgorithmsTechnical Screen - Jane StreetHardSoftware EngineerDecode an Encrypted Paragraph Tree
This question evaluates skills in string parsing, tree serialization/deserialization, and bijective substitution cipher handling, assessing competency in parsing nested structures, character mapping, and traversal within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumSoftware EngineerEvaluate Expressions with Strictly Positive Integer Intermediate Results
Evaluate arithmetic expressions with a supplied decomposition helper, rejecting nonpositive or fractional intermediate results and preserving exact integer division.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumFrontend EngineerField Layout: getOffset and insert
This question evaluates a candidate's ability to model and maintain ordered field layouts by computing and updating byte offsets, testing competencies in dynamic sequence data structures, cumulative offset tracking, and efficient update/query operations.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumSoftware EngineerImplement a Circular Buffer
Implement a fixed-capacity circular buffer (ring buffer) supporting constant-time FIFO operations using wraparound indexing.
Coding & AlgorithmsTechnical ScreenData StructuresQueueArray - Jane StreetEasyMachine Learning EngineerMarketplace Data Store: Order Matching and End-of-Day Reconciliation
This question evaluates understanding of stateful data structures, deterministic order-matching logic, and time-ordered reconciliation of transaction logs, focusing on correct handling of pricing, tie-breaking, and re-opened inventory.
Coding & AlgorithmsTechnical Screen - Jane StreetMediumSoftware EngineerPayout-Split Formula Where Every Step Is a Whole Positive Share
Write a parser and evaluator for arithmetic formulas that describe splitting a prize pool into whole-unit shares, where every intermediate computed amount must be a positive whole number or the entire formula is rejected. Tests recursive-descent parsing combined with evaluation rules where a single bad step invalidates the whole result.
Coding & AlgorithmsTechnical Screenparsingrecursionarithmetic - Jane StreetHardSoftware EngineerReach a Target Using Each Number At Most Once
This question evaluates the ability to construct arithmetic expressions from a multiset of numbers and reason about combinatorial search, operator composition, parenthesization, and exact rational arithmetic under constraints.
Coding & AlgorithmsTechnical Screen - Jane StreetHardSoftware EngineerSnake Game: Minimum Moves to Reach the Apple
This question evaluates proficiency in state-space modeling, constrained grid pathfinding, and dynamic collision handling, testing skills in shortest-path reasoning and movement legality within the Coding & Algorithms domain; the level of abstraction is practical application of algorithmic techniques to simulate evolving game states rather than purely theoretical analysis. It is commonly asked in technical interviews because it requires reasoning about evolving constraints and reachable states, demonstrating an applicant's ability to model complex movement rules and perform effective search under limited grid and body-size constraints.
Coding & AlgorithmsTechnical Screen - Jane StreetEasySoftware EngineerStack Machine Interpreter with Typed Int and String Values
This question evaluates understanding of stack-machine semantics, runtime type representation and preservation of distinct integer versus string values, plus handling mixed-type ADD behavior and output semantics.
Coding & AlgorithmsTechnical Screen - Jump TradingMediumSoftware EngineerExplain C++ vector, unordered_map, and virtual functions
Explain C++ vector, unordered_map, and virtual functions 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 - Jump TradingEasySoftware EngineerLargest Subset With Positive Bitwise AND
This problem tests your understanding of bitwise operations and greedy array partitioning to maximize the size of a subset that results in a non-zero bitwise AND.
Coding & AlgorithmsTechnical ScreenBit ManipulationGreedyArrays - KaratMediumSoftware EngineerJoin tables to map userId to name
This question evaluates a candidate's skills in relational data joining, data integration, and numeric reconciliation for mapping userId to customerName across multiple tables.
Coding & AlgorithmsTechnical Screen
Intuit
J.P. Morgan
Jane Street