Katkat

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 181–210 of 427 results

  • IBMMediumSoftware Engineer
    Manage Authentication Tokens with a Fixed Time to Live

    Design an authentication token manager that handles token generation, renewal, and active token counting based on a fixed time-to-live.

    Coding & AlgorithmsOnline AssessmentHash MapDesignQueue
  • IBMMediumSoftware Engineer
    Maximize Revenue from Depleting VM Inventory

    This problem tests your ability to efficiently manage and update a dynamic collection of items using a priority queue to always extract the maximum value.

    Coding & AlgorithmsOnline AssessmentBinary SearchGreedyOptimization
  • IBMMediumSoftware Engineer
    Maximize Revenue from Depleting VM Stock

    Tests greedy optimization, sorting, and arithmetic progression math to compute maximum revenue from diminishing-value stock with large order quantities.

    Coding & AlgorithmsOnline Assessmentgreedybinary-searchmath
  • IBMEasySoftware Engineer
    Sum Pairwise Remainders Across Two Integer Ranges

    Calculate the total sum of remainders obtained by taking each integer in a dividend range modulo each non-zero divisor in a divisor range. The problem tests division properties, edge-case handling for zero divisors, and avoiding integer overflow.

    Coding & AlgorithmsOnline AssessmentMathAlgorithmsArithmetic
  • IBMEasySoftware Engineer
    Sum the XOR of Every Cross-Array Pair

    Tests bitwise frequency analysis and arithmetic optimization by reducing an O(N * M) cross-product XOR sum to an O(B * (N + M)) bit-by-bit contribution calculation.

    Coding & AlgorithmsOnline Assessmentbit-manipulationmatharrays
  • ImcHardSoftware Engineer
    Choose container set to minimize waste

    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.

    Coding & AlgorithmsOnline Assessment
  • ImcMediumSoftware Engineer
    Find k-th recipient in command propagation order

    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.

    Coding & AlgorithmsOnline Assessment
  • InstacartMediumBackend Engineer
    Fix the Broken Search Filter in a Book Catalog API

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

    Coding & AlgorithmsOnline AssessmentFilteringStringsBackend
  • InstacartMediumSoftware Engineer
    Implement an In-Memory File Storage System

    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.

    Coding & AlgorithmsOnline Assessment
  • InstacartMediumSoftware Engineer
    Implement prefix and suffix file search

    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.

    Coding & AlgorithmsOnline Assessment
  • InstacartMediumSoftware Engineer
    Implement 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 Engineer
    Implement 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
  • Interactive BrokersMediumSoftware Engineer
    Calculate 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 Engineer
    Calculate 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
  • IntuitMediumSoftware Engineer
    Find 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 Engineer
    Produce 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 Engineer
    Sum 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
  • J.P. MorganMediumSoftware Engineer
    Group 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. MorganMediumSoftware Engineer
    Minimize 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 Engineer
    Split 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
  • Jane StreetMediumSoftware Engineer
    Implement 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 StreetMediumQuantitative Trader
    Solve queue switch and coin change puzzles

    This two-part question evaluates probabilistic reasoning about expected waiting times with random queue switching and combinatorial/algorithmic counting for coin-change combinations, testing skills in probability, expectation and order statistics as well as combinatorics and dynamic programming within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • Jump TradingEasySoftware Engineer
    Expand a Serial and Parallel Task Composition Specification

    Tests parsing structured workflow specifications with nested delimiters and quoted literals, then generating all concrete serial execution paths via Cartesian expansion.

    Coding & AlgorithmsOnline AssessmentString ParsingRecursionBacktracking
  • Jump TradingEasySoftware Engineer
    Identify Files That Need Synchronization

    Determine which files from a source system need to be synchronized to a destination system based on permissions, presence, size, and modification timestamps.

    Coding & AlgorithmsOnline Assessmenthash-tablestringimplementation
  • Jump TradingMediumSoftware Engineer
    Identify read-only files from permission records

    This problem tests your ability to parse Unix-style permission strings and implement filtering logic based on bitmask-like constraints.

    Coding & AlgorithmsOnline AssessmentString ParsingFilteringAlgorithms
  • Jump TradingMediumMachine Learning Engineer
    Solve stock trading with pattern rules

    This set of problems evaluates algorithmic skills in pattern recognition, state management, and sequence processing, specifically testing pattern-based decision rules on time-series stock data and iterative substring elimination in string processing within the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • Jump TradingMediumMachine Learning Engineer
    Solve stock-pattern trading and substring elimination

    This question evaluates algorithmic skills in array pattern recognition and string processing, specifically detecting day-to-day sign patterns for simulated trading and repeated elimination of fixed two-character substrings; it belongs to the Coding & Algorithms domain for a Machine Learning Engineer position and targets practical application of linear-time, constant-extra-space techniques. It is commonly asked to evaluate efficient O(n) algorithm design, handling of stateful streaming simulations and in-place string reduction under tight time/space constraints, and correctness reasoning for edge cases.

    Coding & AlgorithmsOnline Assessment
  • KneronMediumSoftware Engineer
    Compute sum of minima with removals

    Compute sum of minima with removals 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 & AlgorithmsOnline Assessment
  • LyftMediumSoftware Engineer
    Assign Minimum Workers to Jobs

    This problem tests your ability to manage overlapping intervals and greedy resource allocation using minute-based time arithmetic.

    Coding & AlgorithmsOnline AssessmentSweep-lineIntervalsGreedy
  • MathWorksMediumSoftware Engineer
    Compute intersections for each segment

    This question evaluates algorithmic problem-solving, interval reasoning, and complexity-analysis skills by requiring an efficient method to count how many other segments intersect each interval while accounting for edge cases like equal endpoints and duplicate segments.

    Coding & AlgorithmsOnline Assessment