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 1201–1230 of 2629 results
- 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 - 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. MorganMediumSoftware EngineerGroup anagrams and count string in grid
This question evaluates algorithmic problem-solving skills in string processing, hashing/grouping and grid traversal/backtracking, along with the ability to analyze time and space complexity and trade-offs.
Coding & AlgorithmsOnline Assessment - J.P. MorganEasySoftware EngineerGroup strings that are anagrams
This problem tests your ability to efficiently group strings based on their character counts and your knowledge of hash maps to solve anagram-related categorization problems.
Coding & AlgorithmsOnsiteHash MapString ManipulationAlgorithms - 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. MorganMediumSoftware EngineerMinimize Operations to Balance Shipments
This question evaluates algorithmic optimization and array partitioning skills, focusing on modeling minimal integer adjustments to equalize partition sums and demonstrating numerical reasoning under constraints.
Coding & AlgorithmsOnline Assessment - J.P. MorganMediumSoftware EngineerSplit Modules Across Three Servers to Maximize the Minimum Deployment Difficulty
Assign modules with given difficulty values to three non-empty servers so that the smallest value of |d1 - d2| + |d2 - d3|, over one module picked from each server, is as large as possible. Tests max-min reasoning over partitions, the role of the middle server, and handling of duplicates and large values.
Coding & AlgorithmsOnline Assessment - J.P. MorganMediumSoftware EngineerTwo Sum — Indices Summing to a Target
This question tests the ability to trade space for time by using a hash map to achieve linear time complexity when finding a pair of elements that satisfy a target sum.
Coding & AlgorithmsOnsiteArraysHash MapsAlgorithms - 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 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 StreetMediumSoftware EngineerImplement Connect Four with bottom push-up
This question evaluates proficiency in data structures, algorithm design, state management, and API design for game mechanics, focusing on board representation, move operations, win detection, and undo/redo functionality.
Coding & AlgorithmsOnline Assessment - 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 StreetHardSoftware EngineerOptimize trade PnL table updates
Design an incremental PnL tracking engine that efficiently aggregates realized and unrealized profit-and-loss across overlapping predicate views under high-frequency trade and price tick updates.
Coding & AlgorithmsOnsiteDesignData StructuresCaching - 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
Intuit
J.P. Morgan
Jane Street