Coding & Algorithms interview questions

Showing 3151–3180 of 3276 results

• 2D Max Pooling That Also Returns the Coordinates of Each Window MaximumMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Build an Expression That Reaches a TargetMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Can You Reach the Last Index?Medium

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

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Character at a Position in a Run-Length Encoded String Without DecodingMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Compute ETA between two map nodesMedium

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

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Max Pooling Values and CoordinatesMedium

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

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count Squares Formed by Intersections of Vertical and Horizontal SegmentsMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Count Squares Formed by SegmentsHard

  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.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Debug Tensor Conversion BugsMedium

  This question evaluates debugging and implementation-level skills in tensor and array manipulation, focusing on aliasing behavior, conversion between column lists and ndarrays, correct handling of non-divisible chunking, and writing tests for these issues.

  WaymoMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Decide If a Vehicle Is Ready to Go from Open/End Maintenance EventsMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine Complete Interval CoverageMedium

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

  WaymoSite Reliability EngineerCoding & AlgorithmsTechnical Screen
• Determine earliest collision among moving carsEasy

  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.

  WaymoData ScientistCoding & AlgorithmsTechnical Screen
• Does a Seven-Segment LED Digit Display Read the Same Rotated 180 Degrees?Medium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• End-Picking Number Game: Can the First Player Win Under Optimal Play?Medium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Expand Nested Repetition ExpressionsMedium

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

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Filter Matching Subtrees from an N-Ary TreeMedium

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

  WaymoFrontend EngineerCoding & AlgorithmsOnsite
• Find Dictionary Words Represented by Repeated LettersHard

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

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Find Every Island in a Grid and Measure Its Boundary with WaterMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Shortest Knight PathMedium

  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).

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find Shortest Paths to Target NodesMedium

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

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find a Repeating Vehicle Program Under Fuel and Memory LimitsHard

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

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Meeting Point on a GridMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Fixed-Capacity Least-Recently-Used Cache Driven by Get and Put OperationsMedium

  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.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Format Bytes as a Hex and ASCII DumpMedium

  This problem tests string manipulation, modular arithmetic, and careful handling of formatting constraints to produce a standardized hexadecimal memory dump.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Generate Instructions for a Blind Maze RobotHard

  This question evaluates a candidate's ability to design algorithmic strategies for state-space synchronization, graph traversal, and reasoning under partial observability in grid environments.

  WaymoMachine Learning EngineerCoding & AlgorithmsOnsite
• Implement Fibonacci generator, balanced BST, frozensetMedium

  This problem tests your understanding of Python generators for sequence generation, the mechanics of tree rotations in self-balancing data structures, and the requirements for implementing immutable, hashable collections.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Safe Average FunctionMedium

  This question evaluates proficiency with basic programming fundamentals including numeric computation, handling edge cases such as empty inputs, input immutability, and data type consistency.

  WaymoData ScientistCoding & AlgorithmsOnline Assessment
• Implement nested template string substitutionEasy

  This problem tests your ability to handle recursive data structures and string parsing by expanding nested placeholders within a template string while identifying potential circular dependencies.

  WaymoData ScientistCoding & AlgorithmsOnsite
• In-Place Rectangle Copy Within a 2D Array Using O(1) Extra MemoryMedium

  Copy a rectangular block of a 2D array to another position in the same array, in place with O(1) extra memory, where the source and destination blocks may overlap. Tests choosing a safe copy direction so that no value is overwritten before it is read.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Insert +, -, * and Parentheses Between Ordered Numbers to Reach a TargetMedium

  Given numbers in a fixed order and a target, insert +, - or * between them and add parentheses to reach the target, returning the lexicographically smallest fully parenthesized expression or an empty string. Starts with three numbers and generalizes to n, testing exhaustive search over expression trees.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite