Katkat

practice a little every day, paws crossed ♡

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 7321–7350 of 9403 results

  • 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
  • RipplingMediumMachine Learning Engineer
    Implement stack and interval algorithms with tests

    This question evaluates implementation-level competencies with fundamental data structures and algorithms—stack-based bracket validation, interval merging with open/closed endpoint semantics, and arithmetic expression evaluation using stacks—while also measuring the ability to design comprehensive unit tests; category: Coding & Algorithms for a Machine Learning Engineer role. It is commonly asked to gauge practical coding ability, correctness under tricky edge cases and input semantics, and test-coverage awareness, representing a practical application-level assessment that also requires conceptual reasoning about invariants and boundary behavior.

    Coding & AlgorithmsOnsite
  • RipplingMediumSoftware Engineer
    Plan CI Build Job Order with Prerequisites, Urgency and Filters

    Order CI build jobs so that prerequisites come first, more urgent jobs go earlier, filtered-out jobs are skipped without breaking ordering through them, and jobs can be grouped into parallel waves. Tests Kahn's algorithm, deterministic tie-breaking, cycle reporting, and turning a detailed spec into code.

    Software Engineering FundamentalsTechnical Screentopological-sortheapgraphs
  • RipplingHardSoftware Engineer
    Present a Project and Reflect

    This question assesses the candidate's ability to articulate the end-to-end lifecycle of a complex project, focusing on technical decision-making, team collaboration, and the ability to critically analyze one's own performance.

    Behavioral & LeadershipOnsiteBehavioralLeadershipCommunication
  • RipplingMediumSoftware Engineer
    Prevent Duplicate Payments Under High Load

    Design a highly reliable payment processing system that guarantees exactly-once execution and prevents duplicate charges during high-concurrency spikes and downstream failure scenarios.

    System DesignOnsiteDistributed SystemsPaymentsConcurrency
  • RipplingMediumBackend Engineer
    Process a Task List: Deduplicate, Drop Completed, Sort by Priority, and Nest Subtasks

    Senior backend coding question: process a batch of scheduler tasks by removing duplicates on description and due date, dropping completed tasks, sorting by priority, and placing each subtask directly after its parent. It tests clarifying ambiguous policies, orphan and cycle handling, O(n log n) design, and verified use of an AI coding assistant.

    Software Engineering FundamentalsOnsite
  • RipplingHardSoftware Engineer
    Propagate Task Filtering Through Ancestors

    Design an algorithm to filter a hierarchy of tasks where any task failing a predicate—or having any ancestor that fails or is missing—is excluded along with all its descendants, running in linear time and preserving original order.

    Software Engineering FundamentalsTechnical Screenrecursiongraphmemoization
  • RipplingMediumSoftware Engineer
    Rank five-card hands by type, then find best and worst completions of unknown cards

    A two-part coding question on a poker-like card game: compare two five-card hands by a fixed type priority with ties broken card by card, then find the best and worst complete hands when the last cards are unknown. Tests hand classification, ordering keys, testing discipline and search over completions.

    Software Engineering FundamentalsTechnical Screen
  • RipplingMediumBackend Engineer
    Senior Backend Hiring Manager Deep Dive: Idempotency, SLAs, Changed Decisions, and Pushback

    Senior backend hiring manager round covering your proudest project with deep dives on idempotency and SLA definition and monitoring, a technical decision you reversed, a design a colleague challenged, and company-specific motivation. It tests ownership, technical depth, judgment under disagreement, and honest self-reflection.

    Behavioral & LeadershipOnsite
  • 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
  • RipplingMediumSoftware Engineer
    Staff Engineer Hiring-Manager Round: Platform Ownership, AI Adoption, and Cross-Team Influence

    This question assesses the candidate's ability to drive complex, cross-functional engineering initiatives and their strategic approach to integrating emerging technologies like AI into legacy or established platforms.

    Behavioral & LeadershipOnsiteLeadershipSystem ArchitectureStakeholder Management
  • RipplingMediumSoftware Engineer
    Stagehand Wage Ledger With Accrued and Settled Pay

    Design an in-memory class that tracks hourly pay for theater stagehands across logged call times, keeps running cost totals, and settles wages up to a cutoff without ever paying the same minute twice.

    Software Engineering FundamentalsTechnical Screenoop-designpayrollidempotency
  • 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
    Task Scheduler with Dependencies, Priorities and Filters

    Coding question that asks for a task scheduler built from a detailed specification: tasks must come after their dependencies, follow priority or importance rules, and pass configurable filters. It tests topological ordering, deterministic tie-breaking, cycle handling and turning many interacting requirements into correct, tested code.

    Software Engineering FundamentalsTechnical Screen
  • 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
  • RipplingMediumSoftware Engineer
    Tutor Billing Ledger With Idempotent Invoice Cutoffs

    Implement an in-memory ledger for hourly tutors that logs sessions, reports total and outstanding amounts in O(1), and invoices work up to a cutoff without ever billing the same minute twice. Tests stateful design, exact arithmetic, and handling of partial and late-logged work.

    Software Engineering FundamentalsTechnical Screenobject-oriented-designidempotencymoney
  • RipplingEasySoftware Engineer
    Walk Through Your Current Role, a Recent Work Challenge, and How You Use AI Tools

    A recruiter screen for a senior software engineer role asks you to introduce yourself with a focus on your current team and responsibilities, describe a recent challenge at work and how you resolved it, and explain how you use AI tools day to day. It tests concise storytelling, senior-level ownership, and judgment about verifying AI output.

    Behavioral & LeadershipHR Screen
  • RipplingMediumSoftware Engineer
    Walk through a project deep dive

    This question evaluates a software engineer's technical leadership, system design reasoning, decision-making under constraints, measurable impact analysis, and mentorship competencies within the Behavioral & Leadership domain of software engineering.

    Behavioral & LeadershipTechnical Screen
  • RipplingMediumSoftware Engineer
    Why do you want to join this company?

    This question evaluates a candidate's ability to articulate past experience and measurable impact, communicate clear motivation, and demonstrate fit for a specific team or company, targeting communication, self-presentation, leadership, and career-alignment competencies for a Software Engineer role.

    Behavioral & LeadershipOnsite
  • RivianMediumSoftware Engineer
    Design and Debug an Automotive Sensor and Camera-Blockage System

    Tests your ability to design an automotive perception sensor layout and lens-blockage detection system, define safe vehicle degradation strategies, and systematically troubleshoot intermittent false-positive diagnostic alerts in the field.

    System DesignTechnical ScreenAutonomous VehiclesComputer VisionEmbedded Systems
  • Ro.CoMediumMachine Learning Engineer
    Debug an inaccurate patient-message triage classifier service and write up fixes

    A one-hour take-home for a senior applied AI engineering role: debug a telehealth service that sorts patient messages into care categories with an urgency and a confidence score, decide when to call an LLM or send a message to manual review, and write up bugs, priorities and trade-offs. It tests debugging, safety judgment and ML evaluation.

    Machine LearningOnline Assessment
  • RobinhoodHardData Engineer
    Aggregate user logs into 30-minute sessions

    This question evaluates data engineering competencies in time-series sessionization, datetime parsing and arithmetic, grouping and aggregation, distinct-count computation, and CSV log processing.

    Coding & AlgorithmsTechnical Screen
  • RobinhoodMediumFrontend Engineer
    Build a Chainable Rectangle Manipulation API

    This problem tests your ability to design a fluent interface (method chaining) that manages an internal queue of asynchronous operations to ensure tasks execute sequentially.

    Software Engineering FundamentalsTechnical ScreenJavaScriptFluent-APIAsync
  • RobinhoodMediumFrontend Engineer
    Build a Weekly Calendar

    This question evaluates frontend UI engineering skills, focusing on interactive interface construction, event handling, and state modeling to maintain a single source of truth for events in a weekly calendar grid, and it belongs to the web frontend development and UI/state-management domain.

    Coding & AlgorithmsOnsite
  • RobinhoodMediumSoftware Engineer
    Clarify Friendship Rules and Money-Transfer Semantics Before Choosing an Algorithm

    Clarify friendship and money-transfer requirements, separate graph reachability from accounting, and reason about a conditional implementation and invariants.

    Software Engineering FundamentalsOnsite
  • 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