Katkat

practice a little every day, paws crossed ♡

Coding & Algorithms 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 1621–1650 of 1706 results

  • Walmart LabsMediumSoftware Engineer
    Count ways to make change (DP)

    This problem tests the ability to solve the classic 'Coin Change II' problem using dynamic programming to count the number of unique combinations that sum up to a target amount.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingCombinatoricsOptimization
  • Walmart LabsMediumSoftware Engineer
    Find shared courses between student pairs

    This problem tests your ability to efficiently map relationships and compute intersections between multiple sets to identify commonalities across pairs.

    Coding & AlgorithmsTechnical ScreenHash MapSetData Structures
  • Walmart LabsEasySoftware Engineer
    Find the Longest Even-Length Word

    Tests string tokenization, linear scanning, tie-breaking logic, and handling of edge cases such as absent matches or irregular whitespace.

    Coding & AlgorithmsTechnical ScreenStringsAlgorithmsWalmart
  • Walmart LabsHardSoftware Engineer
    Implement a Range Module with Add, Query, and Remove

    Design a data structure that tracks coverage of real numbers using half-open intervals, supporting dynamic additions, removals, and continuous coverage queries. This tests ordered data structure manipulation, interval merging/splitting invariants, and binary search.

    Coding & AlgorithmsTechnical Screenbinary-searchdesignintervals
  • Walmart LabsMediumSoftware Engineer
    Implement lexicographically smallest Two Sum

    This question evaluates array manipulation, index-level reasoning, and algorithmic efficiency for locating pair sums under lexicographic tie-breaking, testing attention to ordering constraints and correct index selection.

    Coding & AlgorithmsTechnical Screen
  • Walmart LabsHardSoftware Engineer
    Shortest Talent-Covering Team Starting At Each Index

    Practice a sliding-window coding question where each start index needs the shortest contiguous team containing every talent type. This prompt targets hash map counts, two-pointer window management, and O(n) reasoning for large arrays.

    Coding & AlgorithmsTechnical Screen
  • Warner Bros DiscoveryMediumSoftware Engineer
    Implement array rotations and CSV keyword search

    This question evaluates array manipulation and string parsing competencies, focusing on rotating arrays via modular index arithmetic and locating substring occurrences within a simple CSV while mapping each match to row, column, and character position.

    Coding & AlgorithmsTechnical Screen
  • WarpMediumSoftware Engineer
    Implement Terminal Tabs and Split Panels

    This question evaluates the ability to design and implement hierarchical data structures, model tree-based panel layouts, and perform precise serialization/deserialization of nested UI state.

    Coding & AlgorithmsTechnical Screen
  • 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
    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
    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
  • 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
  • WaymoMediumMachine Learning Engineer
    Debug Tensor Conversion Bugs

    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.

    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
  • 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
    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
  • 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
  • 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
    Implement Fibonacci generator, balanced BST, frozenset

    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.

    Coding & AlgorithmsTechnical ScreenPythonGeneratorsBST
  • WaymoMediumData Scientist
    Sample Points Uniformly from a Unit Disk

    Derive uniform random sampling inside a unit disk, explain the radial distribution, and compare a polar sampler with rejection sampling.

    Coding & AlgorithmsTechnical Screen
  • WaymoMediumSoftware Engineer
    Validate a Parent-Child Forest

    This problem tests graph theory fundamentals by requiring the validation of a forest structure, specifically checking for cycle-free properties and valid parent-child node connectivity constraints.

    Coding & AlgorithmsTechnical ScreenGraph TheoryDFSDSU
  • WeRideMediumSoftware Engineer
    Expand algebraic expression with distribution

    This question evaluates parsing of algebraic expressions, application of the distributive law, string manipulation, and algorithmic reasoning about time and extra-space complexity.

    Coding & AlgorithmsTechnical Screen
  • WeRideMediumSoftware Engineer
    Implement Several Core Algorithmic Components

    This problem tests your ability to implement fundamental algorithms, including caching mechanisms, probability transformations, and geometric counting patterns.

    Coding & AlgorithmsTechnical ScreenHashMapsLinked-ListsProbability
  • WeRideMediumSoftware Engineer
    Implement expression expansion to plus-only form

    This question evaluates understanding of expression parsing and algebraic expansion via the distributive property, along with skills in string manipulation, stack-managed state for nested parentheses, and time/space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • WeRideMediumSoftware Engineer
    Implement matrix multiplication and fast exponentiation

    This question evaluates competency in matrix multiplication, modular arithmetic, and exponentiation algorithms as applied to large-scale numeric computations such as sequence generation.

    Coding & AlgorithmsTechnical Screen
  • WhatnotHardSoftware Engineer
    Build User Journey Path Summary

    This question evaluates the ability to transform unordered user action logs into a trie-like path tree, exercising skills in grouping and time-sorting per user, maintaining stable insertion order, counting distinct users per prefix, and producing deterministic preorder string output.

    Coding & AlgorithmsTechnical Screen