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 9121–9150 of 9403 results

  • WaymoMediumSoftware Engineer
    Design a Hybrid Evaluation Platform

    This problem tests your ability to design a multi-modal evaluation infrastructure that balances automated LLM-based grading with human-in-the-loop (HITL) verification to ensure high-fidelity ML model performance metrics.

    ML System DesignOnsiteMLOpsData InfrastructureHuman-in-the-loop
  • WaymoMediumSoftware Engineer
    Design a Matchmaking Service With Join, Cancel, Matching, Notification and Expiry

    Design a matchmaking service that lets players join and cancel requests, pairs compatible players, notifies both, and handles disconnects and expired requests. Tests request state machines, atomic matching, partitioned waiting pools and reliable notification.

    System DesignOnsite
  • WaymoMediumSoftware Engineer
    Design a Real-Time Player Matchmaking Service

    This problem tests the ability to design a distributed, low-latency matchmaking system capable of handling concurrent requests, state consistency, and efficient participant matching.

    System DesignTechnical ScreenDistributed SystemsConcurrencyCaching
  • WaymoMediumSoftware Engineer
    Design a Ride Scheduler

    This problem tests your ability to design a robust scheduling system that handles dynamic task insertion, state transitions, and time-based prioritization using object-oriented principles.

    Software Engineering FundamentalsOnsiteSystem DesignObject-Oriented DesignPriority Queue
  • WaymoMediumSoftware Engineer
    Design a Shared-Ride Matching and Trip Service

    This problem tests the ability to architect a low-latency geospatial matching system that handles concurrency, real-time vehicle tracking, and the complex state management required for shared-ride optimization.

    System DesignOnsiteGeospatialConcurrencyScalability
  • WaymoMediumSoftware Engineer
    Design a System for a Vehicle Fleet Collecting Map Data for Autonomous Driving

    A system design interview question asking you to design the system that runs a vehicle fleet collecting sensor data for autonomous driving maps. It tests coverage and mission planning, offloading very large sensor logs, reliable ingestion, data quality checks, privacy, and storage at petabyte scale.

    System DesignTechnical Screen
  • WaymoMediumSoftware Engineer
    Design an Object Storage Service With Buckets, Keys and Durable Blob Storage

    Design an object storage service where clients store, read, list and delete blobs by key inside buckets. Covers the API, separating metadata from data nodes, replication versus erasure coding, visibility on write, prefix listing, repair and garbage collection.

    System DesignOnsite
  • WaymoMediumSoftware Engineer
    Design an Online Experiment

    This question tests the ability to design a statistically sound A/B test for a machine learning model update in a real-world, dynamic environment, focusing on metric selection and mitigation of interference.

    Machine LearningOnsiteExperimentationA/B TestingCausal Inference
  • WaymoMediumSoftware Engineer
    Design and Implement a Cross-System Object Tracker

    This problem tests your ability to design an efficient data structure for maintaining and merging temporal events associated with multiple system-generated IDs for the same physical object.

    Software Engineering FundamentalsTechnical ScreenDSUData StructuresSystem Design
  • WaymoMediumFrontend Engineer
    Design the Frontend for an AI Chat Application

    This question tests the ability to design a performant and resilient frontend architecture for a real-time, state-heavy AI chat interface capable of handling large message trees and network instability.

    System DesignOnsiteFrontendState ManagementWebSockets
  • WaymoMediumFrontend Engineer
    Design the Frontend of an AI Chat Application With Streaming Replies

    Frontend-focused system design for an AI chat application. It covers component structure, conversation and message state, streaming replies, stop and retry, safe rendering of model output, performance on long conversations, accessibility and the backend API contract.

    System DesignOnsite
  • WaymoMediumSite Reliability Engineer
    Determine Complete Interval Coverage

    This question evaluates understanding of interval coverage, streaming or online algorithms, and data structures for maintaining dynamic unions of intervals as points arrive.

    Coding & AlgorithmsTechnical Screen
  • WaymoEasyData Scientist
    Determine earliest collision among moving cars

    This question evaluates proficiency in kinematics, computational geometry, numerical root-finding, and scalable algorithm design for collision detection among moving objects, including attention to numerical precision and overlapping trajectories.

    Coding & AlgorithmsTechnical Screen
  • WaymoMediumSoftware Engineer
    Does a Seven-Segment LED Digit Display Read the Same Rotated 180 Degrees?

    Decide whether a row of digits on a seven-segment LED display reads the same after the whole display is rotated by 180 degrees. Tests modeling each digit as lit segments, mapping segments under rotation, and comparing the reversed display.

    Coding & AlgorithmsOnsite
  • WaymoMediumSoftware Engineer
    Drive a Car to an Unseen Destination Using Only Local Directions Without Circling

    A car must reach an unseen destination while only learning which directions are open at each step. Implement the search that finds it without driving in circles, testing depth-first exploration, visited tracking, physical backtracking, and cost in moves.

    Software Engineering FundamentalsOnsite
  • WaymoMediumSoftware Engineer
    End-Picking Number Game: Can the First Player Win Under Optimal Play?

    Two players alternately take a number from either end of a row and add it to their score; decide whether the first player can finish with at least as many points as the second under optimal play. Tests minimax reasoning and memoized game-state search.

    Coding & AlgorithmsOnsite
  • WaymoMediumData Scientist
    Estimate Event Rates from Unequal-Probability Samples

    Establish event rates from unequal sampling with inverse-probability weighting, exposure-aware denominators, and efficient stratified allocation.

    Statistics & MathTechnical Screen
  • WaymoEasyData Scientist
    Estimate total attendance from size-biased reservation sample

    This question evaluates understanding of size-biased sampling, selection bias correction, finite-population total estimation, and uncertainty quantification in survey sampling.

    Statistics & MathTechnical Screen
  • WaymoMediumData Scientist
    Evaluate Smart Wait Launch Impact

    This question evaluates a data scientist's competencies in causal inference and experiment analysis, including interpreting A/B test outcomes, trade-offs between conversion and operational metrics, selection of primary and guardrail metrics, and generation of alternative hypotheses.

    Analytics & ExperimentationOnline Assessment
  • WaymoMediumData Scientist
    Evaluate a New Version in Simulation and Explain a Flat Live Result

    Compare model versions on paired simulation scenarios and diagnose why offline improvements may disappear in live rare-event evaluation.

    Analytics & ExperimentationTechnical Screen
  • WaymoMediumSoftware Engineer
    Expand Nested Repetition Expressions

    This problem tests your ability to parse nested patterns and handle recursion or stack-based state management to expand strings defined by repetition rules.

    Coding & AlgorithmsTechnical ScreenStringsRecursionStack
  • WaymoMediumFrontend Engineer
    Filter Matching Subtrees from an N-Ary Tree

    This problem tests tree traversal techniques, string matching, and the ability to handle iterative tree processing to avoid stack overflow in deep structures.

    Coding & AlgorithmsOnsiteTreesN-ary TreeAlgorithms
  • WaymoMediumFrontend Engineer
    Filter an N-ary Tree by Substring and Render It With Indentation in a UI

    Filter an n-ary tree by removing every node whose value contains a substring, along with its subtree, then build a UI that renders the filtered tree with depth-based indentation as the user types. Tests recursion, immutability, state design and rendering.

    Software Engineering FundamentalsOnsite
  • WaymoHardSoftware Engineer
    Find Dictionary Words Represented by Repeated Letters

    Match dictionary words to a repeated-letter string using ordered run characters and count inequalities, with explicit stretch, duplicate, and empty-string semantics.

    Coding & AlgorithmsOnsite
  • WaymoMediumSoftware Engineer
    Find Every Island in a Grid and Measure Its Boundary with Water

    A grid coding problem that asks you to find every island of land cells and report the length of each island's boundary with water, including enclosed lakes and grid edges. It tests grid traversal, connected components, careful edge counting, and deterministic output ordering.

    Coding & AlgorithmsTechnical Screen
  • WaymoMediumSoftware Engineer
    Find Shortest Knight Path

    This problem tests the ability to model a constrained movement pattern on a 2D grid as an unweighted graph and efficiently find the shortest path using Breadth-First Search (BFS).

    Coding & AlgorithmsTechnical ScreenBFSGraphGrid
  • WaymoMediumSoftware Engineer
    Find Shortest Paths to Target Nodes

    This question evaluates knowledge of graph algorithms and algorithmic problem-solving, specifically computing shortest paths in weighted directed graphs and handling unreachable targets.

    Coding & AlgorithmsTechnical Screen
  • WaymoHardSoftware Engineer
    Find a Repeating Vehicle Program Under Fuel and Memory Limits

    Find any repeating vehicle program of at most ten commands with fuel and obstacles, using complete bounded search, terminating simulation, and explicit execution assumptions.

    Coding & AlgorithmsOnsite
  • WaymoMediumSoftware Engineer
    Find the Best Meeting Point on a Grid

    This problem tests your ability to use multi-source Breadth-First Search (BFS) to find a point that minimizes total travel distance across a grid with obstacles.

    Coding & AlgorithmsTechnical ScreenBFSGraphGrid
  • WaymoMediumSoftware Engineer
    Fixed-Capacity Least-Recently-Used Cache Driven by Get and Put Operations

    Design a fixed-capacity least-recently-used cache as an object-oriented exercise, driven here by a list of get and put operations whose read results you return. Tests O(1) lookup, recency updates on reads and writes, and correct eviction order.

    Coding & AlgorithmsOnsite