Coding & Algorithms interview questions

Showing 1441–1470 of 3276 results

• Count requests dropped when incoming requests exceed available server threadsMedium

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count substrings and generate TOCEasy

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Maximum-Sum Contiguous SubarrayMedium

  Implement Kadane's algorithm to find the maximum sum of a non-empty contiguous subarray in linear time and constant auxiliary space, with proper handling for all-negative inputs and potential 64-bit integer overflow.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Group anagrams and count string in gridMedium

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Group strings that are anagramsEasy

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnsite
• Implement Integer Square RootMedium

  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.

  J.P. MorganData ScientistCoding & AlgorithmsTechnical Screen
• Implement KNN from ScratchMedium

  This problem tests your ability to implement the K-Nearest Neighbors (KNN) algorithm from scratch, focusing on distance computation, sorting, and majority voting logic.

  J.P. MorganData ScientistCoding & AlgorithmsTechnical Screen
• Implement Merge SortMedium

  This problem tests your ability to implement the Divide and Conquer paradigm, specifically the recursive merge sort algorithm, while maintaining stability and managing auxiliary space.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Implement an O(1) LRU CacheEasy

  This problem tests your ability to combine a hash map with a doubly linked list to achieve O(1) time complexity for cache operations.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Overlapping IntervalsMedium

  This problem tests your ability to manipulate array-based data by identifying and merging intersecting ranges using a greedy sorting strategy.

  J.P. MorganSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize Operations to Balance ShipmentsMedium

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Return Every Index Pair Whose Values Sum to a TargetMedium

  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.

  J.P. MorganMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Return the K Largest IntegersMedium

  This problem tests the ability to efficiently find the k largest elements in an unsorted array using heap-based data structures to optimize for cases where k is significantly smaller than the input size.

  J.P. MorganSoftware Engineer IICoding & AlgorithmsOnsite
• Solve tiling, probability, and nested-radical puzzlesMedium

  This problem tests your ability to derive recurrence relations for combinatorial tiling, solve infinite series limits, and calculate exact probabilities using combinations.

  J.P. MorganData ScientistCoding & AlgorithmsOnsite
• Split Modules Across Three Servers to Maximize the Minimum Deployment DifficultyMedium

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnline Assessment
• Two Sum — Indices Summing to a TargetMedium

  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.

  J.P. MorganSoftware EngineerCoding & AlgorithmsOnsite
• Board Simulation: Bottom-Insert Pieces with Uniform Row and Column DetectionMedium

  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.

  Jane StreetMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Bottom-Insertion Connect Game: Detect the First k-in-a-Row WinnerMedium

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Code Editor with Block Shrink and Expand (Code Folding)Medium

  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.

  Jane StreetMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Connect-N on an Infinite Board with GravityMedium

  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.

  Jane StreetMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Decode an Encrypted Paragraph TreeHard

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Evaluate Expressions with Strictly Positive Integer Intermediate ResultsMedium

  Evaluate arithmetic expressions with a supplied decomposition helper, rejecting nonpositive or fractional intermediate results and preserving exact integer division.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Field Layout: getOffset and insertMedium

  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.

  Jane StreetFrontend EngineerCoding & AlgorithmsTechnical Screen
• Implement Connect Four with bottom push-upMedium

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement a Circular BufferMedium

  Implement a fixed-capacity circular buffer (ring buffer) supporting constant-time FIFO operations using wraparound indexing.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Marketplace Data Store: Order Matching and End-of-Day ReconciliationEasy

  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.

  Jane StreetMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Optimal Stopping for Die Rolls That Bust on Perfect SquaresMedium

  This question evaluates probabilistic reasoning and optimal stopping competency, testing understanding of Markov decision processes, expected-value calculations, and risk trade-offs in stochastic processes.

  Jane StreetQuantitative TraderCoding & AlgorithmsOnsite
• Optimize trade PnL table updatesHard

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsOnsite
• Payout-Split Formula Where Every Step Is a Whole Positive ShareMedium

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen
• Reach a Target Using Each Number At Most OnceHard

  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.

  Jane StreetSoftware EngineerCoding & AlgorithmsTechnical Screen