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 5701–5730 of 5874 results

  • WayfairHardSoftware Engineer
    Maximize the Product of Pair Distance and Minimum Value

    Tests optimal two-pointer and greedy reasoning to maximize a distance-weighted minimum value pair in linear time.

    Coding & AlgorithmsTechnical ScreenTwo PointersGreedyArrays
  • WaymoMediumSoftware Engineer
    2D Max Pooling That Also Returns the Coordinates of Each Window Maximum

    Implement 2D max pooling with a k-by-k window and a stride, and for each window also return the row and column of its maximum, breaking ties by smallest row then column. Tests window indexing without padding, output sizing, and argmax bookkeeping.

    Coding & AlgorithmsOnsite
  • WaymoMediumSoftware Engineer
    Build an Expression That Reaches a Target

    This problem tests your ability to use recursion with backtracking or dynamic programming to partition a sequence of numbers and apply operators to satisfy a target value.

    Coding & AlgorithmsTechnical ScreenRecursionBacktrackingMemoization
  • WaymoMediumSoftware Engineer
    Can You Reach the Last Index?

    This problem tests your ability to determine reachability in a sequence using greedy strategy or dynamic programming to optimize pathfinding.

    Coding & AlgorithmsOnsiteArraysGreedyDynamic Programming
  • WaymoMediumSoftware Engineer
    Character at a Position in a Run-Length Encoded String Without Decoding

    Given a run-length encoded string such as B1A2E3C1, return the character at each queried position of the decoded sequence without decoding it. Runs can be very long, so the task tests prefix sums over run lengths and fast lookup per query.

    Coding & AlgorithmsOnsite
  • WaymoMediumSoftware Engineer
    Compute ETA between two map nodes

    This problem tests your ability to implement Dijkstra's algorithm to find the shortest path in a weighted directed graph representing a road network.

    Coding & AlgorithmsTechnical ScreenGraphsShortest PathDijkstra
  • WaymoMediumSoftware Engineer
    Compute Max Pooling Values and Coordinates

    This problem tests your ability to manipulate 2D arrays, manage sliding window bounds, and track metadata (indices) efficiently during a data transformation task.

    Coding & AlgorithmsTechnical ScreenArrays2D-GridSliding-Window
  • WaymoMediumSoftware Engineer
    Count Squares Formed by Intersections of Vertical and Horizontal Segments

    Given vertical and horizontal line segments defined by start and end points, count the axis-aligned squares whose four corners are all segment intersection points. Tests intersection detection, square enumeration, and faster ways to find which segments cross each other.

    Coding & AlgorithmsOnsite
  • WaymoHardSoftware Engineer
    Count Squares Formed by Segments

    Count distinct axis-aligned squares whose full sides are covered by horizontal and vertical integer-coordinate segments. Normalize and merge collinear coverage, avoid duplicate geometric squares, support overlapping segments and negative coordinates, and index interval coverage efficiently.

    Coding & AlgorithmsTechnical Screen
  • WaymoMediumSoftware Engineer
    Decide If a Vehicle Is Ready to Go from Open/End Maintenance Events

    Given a vehicle maintenance log of open and end events with timestamps and maintenance types such as oil or brake, decide whether the vehicle is ready to go. The problem tests chronological event processing with a stable tie rule, per-type state tracking, and detecting unmatched ends, overlapping opens, and tasks left open.

    Coding & AlgorithmsTechnical Screen
  • WaymoMediumSoftware Engineer
    Deduplicate a 256 GB File on a Machine With 128 MB of Memory

    Remove duplicate records from a single 256 GB file on a machine with only 128 MB of memory. Tests external-memory techniques such as hash partitioning and external merge sort, skew handling, I/O cost, open-file limits, and preserving the original order.

    Software Engineering FundamentalsOnsite
  • WaymoMediumSoftware Engineer
    Describe a Complex Project You Worked On and Why It Was Challenging

    Behavioral hiring-manager question: describe a complex project you worked on and explain why it was challenging, often after a resume walk-through. Tests choosing a project that fits the level, naming the real difficulty, personal ownership and outcomes.

    Behavioral & LeadershipOnsite
  • WaymoMediumSoftware Engineer
    Describe a Project You Are Proud Of

    This question tests your ability to articulate a technical contribution, demonstrate engineering judgment, and communicate impact within a high-stakes team environment.

    Behavioral & LeadershipOnsiteBehavioralCommunicationOwnership
  • WaymoMediumSoftware Engineer
    Design Reliable Command Delivery Between Autonomous Vehicles and the Cloud

    Design a resilient, secure command dispatch and execution system between a cloud fleet management platform and autonomous vehicles operating over unreliable cellular networks.

    System DesignOnsiteDistributed SystemsIoTNetworking
  • WaymoHardSoftware Engineer
    Design a Fleet That Collects Mapping Data

    Design fleet mapping-data collection with coverage goals, task assignment, offline buffering, resumable uploads, provenance, quality validation, and re-collection workflows.

    System DesignOnsite
  • WaymoMediumSoftware Engineer
    Design a Global Small-Image Caching Service

    This problem tests the ability to design a highly available, globally distributed caching layer that handles high-throughput small-image delivery while maintaining data consistency and resilience against origin failures.

    System DesignTechnical ScreenCachingDistributed SystemsLatency
  • 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
  • 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
  • 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
  • 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