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 2521–2550 of 2629 results
- Walmart LabsEasySoftware EngineerFind 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 EngineerFind the Single Repeated Value Among n + 1 Integers Drawn from 1 to n
Given an array of n + 1 integers whose values all lie between 1 and n, return the one value that repeats, possibly several times. The challenge is solving it without modifying the array and with constant extra memory, which rules out sorting, hash sets and counting arrays.
Coding & AlgorithmsOnsite - Walmart LabsHardSoftware EngineerImplement 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 EngineerImplement 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 LabsMediumSoftware EngineerMaximum Sum of Non-Adjacent Values in a Row
A coding problem that asks for the largest total obtainable from a row of non-negative values when no two chosen positions may be adjacent. It tests reasoning about take-or-skip choices, edge cases such as empty and single-element rows, and a solution fast enough for rows of up to 100,000 values.
Coding & AlgorithmsOnline Assessment - Walmart LabsMediumSoftware EngineerMinimize Cost for Feature-Capable Models
This problem tests your ability to use greedy strategies or dynamic programming to satisfy coverage constraints while minimizing total costs from a set of available items.
Coding & AlgorithmsOnline AssessmentGreedyOptimizationCombinatorics - Walmart LabsMediumSoftware EngineerMinimize the Maximum Edge on a Path
Find a path in a weighted undirected graph that minimizes its largest edge rather than the sum of weights. Handle parallel edges, disconnected vertices, and the start-equals-target case efficiently at large graph scale.
Coding & AlgorithmsOnline Assessment - Walmart LabsHardSoftware EngineerProduct of All Other Elements for Each Index Without Division
For each position of an integer array, compute the product of all the other elements in linear time and without using division. It tests careful handling of zeros, negative values and repeated values, and planning a single efficient pass when the obvious division shortcut is not allowed.
Coding & AlgorithmsOnsite - Walmart LabsHardSoftware EngineerShortest 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 EngineerImplement 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 EngineerImplement 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 EngineerMaximize 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 Engineer2D 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 EngineerBuild 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 EngineerCan 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 EngineerCharacter 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 EngineerCompute 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 EngineerCompute 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 EngineerCount 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 EngineerCount 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 EngineerDecide 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 EngineerDoes 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 EngineerEnd-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 EngineerExpand 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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 EngineerFind 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
Walmart Labs
Wayfair
Waymo