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 1201–1230 of 1706 results

  • RampHardSoftware Engineer
    Detect recurring transactions from a ledger

    This question evaluates skills in detecting temporal recurrence patterns in transaction data, including time-series analysis, date arithmetic, grouping by merchant and currency, and tolerance handling for amounts and date jitter.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Find User Airport at a Time

    This problem tests your ability to efficiently query temporal interval data for a specific user using binary search and interval manipulation.

    Coding & AlgorithmsTechnical ScreenSortingBinary SearchIntervals
  • RampMediumSoftware Engineer
    Find an Exit in a URL Maze

    This question evaluates graph traversal and state-management skills, emphasizing handling cycles, HTTP error conditions, retry logic, and propagation of authorization tokens in a networked client.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Find exit URL via BFS API calls

    This question evaluates graph traversal and resilience when interacting with HTTP APIs, covering BFS/DFS reasoning, cycle detection to avoid infinite loops, retry handling for transient HTTP 500 responses, and timeout management for slow pages.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Navigate maze via HTTP API

    This question evaluates a candidate's ability to implement programmatic traversal of linked resources via an HTTP API, testing skills in network I/O, control flow, state management, and algorithmic traversal.

    Coding & AlgorithmsTechnical Screen
  • RampHardSoftware Engineer
    Track Users From Flight History

    This question evaluates competency in processing and aggregating temporal event data, including time-interval reasoning, counting/grouping per user, and designing efficient data structures and algorithms for large datasets.

    Coding & AlgorithmsTechnical Screen
  • RbcroyalbankMediumMachine Learning Engineer
    Process Operations for an In-Memory Key-Value Store

    This problem tests proficiency with hash map operations and handling data retrieval edge cases within an in-memory data store.

    Coding & AlgorithmsTechnical ScreenHash MapData StructuresAlgorithms
  • Read.AiMediumSoftware Engineer
    Compare Sentences Using Transitive Synonym Groups

    Compare two tokenized sentences using undirected, transitive synonym relationships. Sentence lengths and word positions must match, while a union-find or graph traversal groups chained synonyms and leaves unknown words equivalent only to themselves.

    Coding & AlgorithmsTechnical Screen
  • RedditMediumSoftware Engineer
    Find a Word Along One Fixed Direction in a Grid

    Search a letter grid for a word along one fixed direction, with explicit diagonal rules, boundaries, and rejection of paths that turn.

    Coding & AlgorithmsTechnical Screen
  • RedditMediumSoftware Engineer
    Find word sequence with 1–2 char changes

    This question evaluates graph traversal and shortest-path search skills, specifically reasoning about BFS vs DFS, string transformation modeling, and algorithmic time/space complexity within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • RedditMediumMachine Learning Engineer
    Implement a simplified memcached server

    This problem tests your ability to design a thread-safe, in-memory key-value store and implement basic command parsing for an asynchronous network service.

    Coding & AlgorithmsTechnical ScreenConcurrencyData StructuresCaching
  • RedditMediumSoftware Engineer
    Moderator System with Ranking, Communities, and Demotion

    Design and implement an in-memory moderator management system supporting community-specific hierarchies, seniority-based permissions, and rank mutations.

    Coding & AlgorithmsTechnical ScreenDesignHash TableLinked List
  • RemitlyEasySoftware Engineer
    Compute transfers to balance account debts

    This question evaluates a candidate's ability to convert per-account net balances into a set of transfers, testing algorithmic problem solving, data-structure manipulation, and correctness under conservation invariants in transactional systems.

    Coding & AlgorithmsTechnical Screen
  • RenderMediumSoftware Engineer
    Count Blocked Rate-Limited Requests

    This question evaluates understanding of rate-limiting logic, sliding-window time-based counting, and data structure design for tracking per-IP and per-(IP, host) request histories.

    Coding & AlgorithmsTechnical Screen
  • RenderMediumSoftware Engineer
    Find the Five Busiest Client IPs in Request Logs

    Aggregate completed HTTP request logs across files to find the top five client IPv4 addresses, excluding auxiliary messages and applying deterministic count ties.

    Coding & AlgorithmsTechnical Screen
  • Retell AIEasySoftware Engineer
    Evaluate a Small Stack-Based Integer Language

    Implement an interpreter for a stack-based integer language supporting arithmetic, stack manipulation, output, and immediate error reporting with partial output preservation.

    Coding & AlgorithmsTechnical Screenstackparsingsimulation
  • Retell AIMediumSoftware Engineer
    Query an Indexed In-Memory Numeric Table

    This problem tests the ability to implement efficient multi-column indexing using binary search and sorted set intersections to handle complex range queries.

    Coding & AlgorithmsTechnical ScreenData StructuresBinary SearchIndexing
  • RetoolMediumSoftware Engineer
    Compute max profit with forced trades

    Compute max profit with forced trades 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
  • RevolutMediumSoftware Engineer
    Implement a random fixed-size load balancer

    This question evaluates understanding of randomized selection, efficient in-memory data structures, and API/state management for a fixed-capacity load balancer that must support addNode, removeNode, and uniform random routing while handling duplicates, removals, and empty-state behavior.

    Coding & AlgorithmsTechnical Screen
  • RevolutMediumSoftware Engineer
    Implement a thread-safe money transfer

    This question evaluates a candidate's mastery of concurrent programming and data-integrity principles, focusing on thread safety, atomic state updates, and deadlock avoidance when transferring funds between shared accounts.

    Coding & AlgorithmsTechnical Screen
  • RilletMediumBackend Engineer
    Distribute Annual Revenue Across Twelve Months

    This problem tests logic, integer arithmetic, and edge-case handling by requiring the distribution of a total sum into equal parts while managing remainders without using floating-point numbers.

    Coding & AlgorithmsTechnical ScreenAlgorithmsInteger ArithmeticData Manipulation
  • RiotgamesEasySoftware Engineer
    Aggregate Letter-Number Groups

    This problem tests string parsing, data aggregation using a hash map, and sorting techniques.

    Coding & AlgorithmsTechnical ScreenStringsHash MapsSorting
  • RippleHardSoftware Engineer
    Find path between two nodes in a binary tree

    This question evaluates understanding of tree data structures, traversal and path reconstruction techniques, including reasoning about lowest common ancestors, ancestor–descendant relationships, duplicate identification, and handling absent targets.

    Coding & AlgorithmsTechnical Screen
  • RipplingHardSoftware Engineer
    Bill Deliveries with Historical Rates and Deferred Rounding

    Bill deliveries with start-time historical rates, duplicate suppression, overlapping jobs, exact sub-cent accumulation, and configurable final half-up or half-even rounding.

    Coding & AlgorithmsTechnical Screen
  • RipplingEasySoftware Engineer
    Build an Expense Policy Rule Engine

    This question tests your ability to design a rule evaluation engine that processes structured expense data against a set of logical conditions, including support for basic operators.

    Coding & AlgorithmsTechnical ScreenAlgorithmsData-ModelingRule-Engine
  • RipplingMediumSoftware Engineer
    Compare Complete and Partial Poker Hands

    Implement a poker hand evaluator that determines whether an incomplete poker hand can be completed from the remaining deck to beat an opponent's complete five-card hand.

    Coding & AlgorithmsTechnical Screencombinatoricssearchgame-theory
  • RipplingMediumSoftware Engineer
    Compare Two Five-Card Numeric Hands

    Compare two five-digit numeric hands under a nonstandard multiplicity ranking and original-position right-to-left tie-break, using extensible category evaluators rather than standard poker rules.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Compute concurrent online drivers

    This question evaluates proficiency in algorithms and temporal data handling, including the use of efficient search techniques and complexity reasoning to count distinct active drivers over a sliding 24-hour window.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Compute max simultaneous drivers last 24 hours

    This question evaluates proficiency in reasoning about time-interval overlap, event aggregation, and online data structures for streaming interval queries, testing skills in algorithm design and temporal data handling within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Compute maximum simultaneous drivers

    This English summary evaluates the candidate's proficiency in algorithm design and complexity analysis within the Coding & Algorithms domain, specifically for aggregating interval data and computing concurrent counts.

    Coding & AlgorithmsTechnical Screen