Katkat

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 1981–2010 of 2629 results

  • RipplingMediumSoftware Engineer
    Compare Complete or Partial Hands

    This question evaluates implementation of card-hand evaluation logic, combinatorial reasoning about incomplete information, and deterministic tie-breaking rules for comparing complete and partial poker-like hands.

    Coding & AlgorithmsOnsite
  • 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
  • RipplingMediumSoftware Engineer
    Compute median of two sorted arrays

    This question evaluates algorithmic problem-solving with sorted arrays, focusing on concepts like binary search, partitioning strategies, complexity analysis, and careful handling of edge cases when computing order statistics.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Compute peak busy dashers with overlaps

    This question evaluates skills in interval-overlap reasoning, sweep-line algorithm design, event creation and deduplication, comparator and tie-breaking subtleties, and asymptotic time/space complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Convert amounts between multiple currencies

    This question evaluates understanding of graph modeling and path-optimization in directed weighted graphs, specifically reasoning about chained conversions and maximizing multiplicative path weights.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Courier Delivery Cost Tracker

    Design a stateful tracker class to record courier delivery intervals and earnings, query running courier payouts, and calculate peak concurrent active deliveries within a specific time window.

    Coding & AlgorithmsTechnical ScreenIntervalsLine SweepHash Table
  • RipplingMediumSoftware Engineer
    Design a Driver Payroll System

    Design an in-memory driver payroll system that records time-stamped earnings and supports efficient range queries for both individual drivers and company-wide aggregates.

    Coding & AlgorithmsTechnical Screenbinary-searchprefix-sumdata-structure-design
  • RipplingMediumSoftware Engineer
    Design a music player with favorites cap

    This question evaluates a candidate's ability to design and implement in-memory data structures, stateful APIs, concurrency handling, deterministic policy enforcement for a fixed-capacity favorites feature, and reasoning about edge cases like removing the currently playing track or handling invalid IDs.

    Coding & AlgorithmsOnsite
  • RipplingHardSoftware Engineer
    Evaluate Configurable Rideshare Payout Audit Rules as Data

    Implement a generic rule-evaluation engine for a rideshare payout audit tool, where per-fare and per-driver-total rules, each with its own AND-combined conditions, are supplied entirely as data rather than hard-coded branches, using exact integer-cent arithmetic.

    Coding & AlgorithmsTechnical Screenrule-enginedesigndata-modeling
  • RipplingHardSoftware Engineer
    Evaluate Expense and Trip-Level Rules as Data

    Evaluate configurable expense and trip-sum rules using exact cents, reusable typed predicates, strict thresholds, multiple flags, and deterministic result ordering.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Find bounding boxes of connected houses

    This problem tests your ability to perform graph traversal (BFS/DFS) on a 2D grid to identify distinct connected components and compute their spatial extent.

    Coding & AlgorithmsOnline AssessmentGraphsDFSBFS
  • RipplingMediumSoftware Engineer
    Find median of two sorted arrays

    This question evaluates algorithmic problem-solving skills related to sorted arrays and median computation, testing competency in handling numeric order properties and complexity analysis within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Find the Best and Worst Completion of a Partial Numeric Hand

    Find the strongest and weakest five-card completions of a partial numeric hand under custom category and right-to-left tie-break rules while sharing one extensible comparison engine.

    Coding & AlgorithmsTechnical Screen
  • RipplingMediumSoftware Engineer
    Implement Article Vote Tracking

    Design an in-memory article vote tracking system that manages user upvotes/downvotes, detects vote flips to maintain an LRU-style flip history per user, and provides top-k article rankings by net score.

    Coding & AlgorithmsTechnical Screenhash-tableheapordered-map
  • RipplingMediumSoftware Engineer
    Implement Courier Delivery Cost Tracking

    Design an in-memory billing system that tracks courier pay rates over time and calculates prorated delivery costs across half-open time intervals.

    Coding & AlgorithmsTechnical ScreenDesignBinary SearchIntervals
  • RipplingMediumSoftware Engineer
    Implement Food Delivery Billing

    This problem tests your ability to implement complex billing logic involving conditional fee structures, time-based surcharges, and data aggregation.

    Coding & AlgorithmsOnsiteAlgorithmsDatetimeData Processing
  • RipplingMediumSoftware Engineer
    Implement an In-Memory File System

    Design and implement an in-memory file system supporting directory creation, file appending, reading, and lexicographically sorted path listings.

    Coding & AlgorithmsOnsitetrietreedesign
  • RipplingEasySoftware Engineer
    Implement an article voting tracker

    This question evaluates a candidate's ability to design efficient stateful data structures and algorithms for tracking user votes, including correct handling of idempotent repeated votes, vote changes, deduplication, and retrieval of the most recent events.

    Coding & AlgorithmsTechnical Screen
  • RipplingHardSoftware Engineer
    Solve listed algorithm problems

    This problem tests your ability to model exchange rates as a graph and use path-finding algorithms to detect profitable arbitrage opportunities.

    Coding & AlgorithmsHR ScreenGraphsShortest PathBellman-Ford
  • RipplingHardSoftware Engineer
    Studio Session Billing with Rate Schedules and Exact Rounding

    Build a command-driven billing ledger where technicians' hourly rates change over time, bookings are deduplicated, and fractional cents are kept exactly until an invoice is printed with a configurable rounding mode. Tests rate lookup by time, idempotency rules, and integer-exact money handling.

    Coding & AlgorithmsTechnical Screenhash-mapbinary-searchmoney-arithmetic
  • RipplingMediumSoftware Engineer
    Track article votes and last three flips

    This question evaluates a developer's ability to design in-memory data structures that support constant-time vote updates, score aggregation, and recent flip-event tracking while handling vote-change semantics.

    Coding & AlgorithmsOnsite
  • RobinhoodMediumSoftware Engineer
    Compute Load Factors in a Service Dependency DAG

    Calculate downstream request multipliers for services in a directed acyclic graph (DAG) starting from an entrypoint service, accounting for converging dependency paths and unreachable nodes.

    Coding & AlgorithmsTechnical ScreenGraphTopological SortDAG
  • RobinhoodMediumSoftware Engineer
    Compute dependency load factors in a DAG

    This problem tests your ability to model dependencies in a Directed Acyclic Graph (DAG) and calculate the cumulative 'load' contribution of each node, requiring efficient graph traversal techniques like topological sorting or recursion with memoization.

    Coding & AlgorithmsTechnical ScreenGraphDAGRecursion
  • RobinhoodMediumSoftware Engineer
    Compute nearest gate distance in grid

    This problem tests your ability to perform multi-source Breadth-First Search (BFS) on a grid to find the shortest distance from every cell to the nearest target (gate).

    Coding & AlgorithmsTechnical ScreenBFSGraphsGrid
  • RobinhoodEasySoftware Engineer
    Compute trigger counts in a DAG

    This question evaluates understanding of directed acyclic graphs, graph traversal and accumulation of values across dependency edges, as well as algorithmic efficiency for handling large sparse graphs.

    Coding & AlgorithmsTechnical Screen
  • RobinhoodHardSoftware Engineer
    Count Unique Dependents in a Referral DAG

    Count unique direct and transitive dependents in a DAG, preserving edge direction, ignoring unknown endpoints, and handling shared descendants without double-counting.

    Coding & AlgorithmsOnsite
  • RobinhoodMediumSoftware Engineer
    Design a constrained cache and secure string validator

    This question tests the ability to implement a thread-safe, size-constrained cache (LRU-like) and robust string validation logic for identifying malformed or potentially malicious input strings.

    Coding & AlgorithmsOnsiteConcurrencyLRUHashing