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 1231–1260 of 3276 results
- GoogleMediumSoftware EngineerMaintain k-th largest in a stream
This question evaluates understanding of data structures and streaming algorithms for maintaining k-th order statistics under dynamic inserts, emphasizing time-space trade-offs and correct handling of duplicates.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerMaintain streaming median and loosemedian
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Maintain streaming median and loosemedian states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerMatch Dictionary Words to a Swipe-Keyboard Gesture Path
A coding problem modeled on a swipe keyboard: given the ordered keys a finger passed over and a dictionary, return every word the gesture could spell. It tests precise handling of the start and end keys, doubled letters and duplicate words, and efficient matching of many dictionary words against one gesture path.
Coding & AlgorithmsOnsite - GoogleMediumData ScientistMatch payments to invoices by memo or amount
This problem tests string parsing, hash-map based data indexing, and multi-criteria reconciliation logic (fuzzy matching via IDs vs. exact matching via amount).
Coding & AlgorithmsTechnical ScreenHashingStringsData Reconciliation - GoogleMediumSoftware EngineerMatch people to questions using tags and priorities
This problem tests your ability to model a constrained matching problem using greedy or flow-based approaches while managing priority queues for tie-breaking.
Coding & AlgorithmsTechnical ScreenGreedyHeapsSorting - GoogleMediumSoftware EngineerMaximize 1D deliveries within distance and minimize total distance
This problem tests your ability to prioritize objectives using a greedy strategy or sorting to maximize deliveries while minimizing travel cost within a constrained route.
Coding & AlgorithmsTechnical ScreenSortingGreedyOptimization - GoogleMediumSoftware EngineerMaximize Boundary-Difference Subarray Sum
This question evaluates algorithmic problem-solving skills with emphasis on array processing, constrained subarray sums, and the design of time- and space-efficient algorithms within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerMaximize Throughput Packing Reserved Compute Slots With Limited Stock
Choose how many reserved instances of each type to allocate into a shared rack-slot budget, each instance occupying exactly one slot, to maximize total throughput score given limited stock per type.
Coding & AlgorithmsTechnical Screenknapsackgreedysorting - GoogleMediumSoftware EngineerMaximize coins collected by 3-step pieces
This question evaluates modeling and optimization of discrete state-space transitions under movement constraints, testing combinatorial reasoning, reachability, and resource-maximization competencies.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerMaximize coins collected by tokens jumping +3
Evaluates algorithmic reasoning about constrained discrete moves and optimization, focusing on state-space modeling, reachability under move constraints, and resource-maximization techniques.
Coding & AlgorithmsOnline Assessment - GoogleMediumSoftware EngineerMaximize sum without choosing adjacent elements
This problem tests your ability to solve optimization challenges using dynamic programming by identifying overlapping subproblems and optimal substructure in an array.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingArrayOptimization - GoogleMediumSoftware EngineerMaximize the Equal Wood Segment Length
Tests the ability to solve an optimization problem by applying binary search over a monotonic search space (binary search on answer).
Coding & AlgorithmsOnsitebinary-searcharraysgreedy - GoogleMediumSoftware EngineerMaximum Value from Unit-Weight Items with Limited Copies Under a Capacity
Find the maximum total value that fits in a bag whose capacity can reach one billion units, when every item weighs one unit and each item type has a value and a limited number of identical copies. Tests judging which knapsack techniques scale to huge capacities and copy counts, plus 64-bit arithmetic for large totals.
Coding & AlgorithmsTechnical Screen - GoogleHardSoftware EngineerMerge Two Named Trees: First Tree's Names and Order, Second Tree's Values
Merge two trees whose nodes carry a name, an integer value and an ordered list of children, keeping the first tree's names and child order while taking values from the second. Same-name children pair up by order of appearance and second-tree leftovers are appended, testing careful recursive construction from a rule-heavy specification.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerMin deletions to avoid overlap in first k
This problem tests your ability to identify and remove the minimum number of elements from an array such that a specified prefix contains only unique elements.
Coding & AlgorithmsTechnical ScreenArraysHash MapsGreedy - GoogleMediumSoftware EngineerMinimize Direction Violations in a Directed Road Network
Find the minimum number of edge reversals needed to travel from a source node to a target node in a directed graph. Tests graph modeling (0-1 weighted edges), edge cases like parallel edges and disconnected components, and efficient shortest-path traversal.
Coding & AlgorithmsOnsiteGraphBFSShortest Path - GoogleMediumMachine Learning EngineerMinimize Fence Painting Operations
This problem tests your ability to use a greedy approach or dynamic programming to find the minimum number of strokes required to paint a fence of varying heights.
Coding & AlgorithmsTechnical ScreenGreedyStackArrays - GoogleMediumData ScientistMinimize L2, L1, and quantile losses
This question evaluates understanding of statistical estimators and optimization principles for L2, L1, and tilted absolute (quantile) loss functions, including use of derivatives and subgradients, order-statistics, algorithmic complexity, and robustness considerations.
Coding & AlgorithmsTechnical Screen - GoogleHardSoftware EngineerMinimize maximum height along a grid path
This problem tests your ability to adapt shortest-path algorithms, such as Dijkstra's or Binary Search on the answer, to minimize the maximum edge/node weight along a path.
Coding & AlgorithmsTechnical ScreenGraphDijkstraBinary Search - GoogleMediumSoftware EngineerMinimum Cars for Rental Requests
Determine the minimum number of rental cars required to service a given list of booking requests with half-open time intervals.
Coding & AlgorithmsOnsiteintervalsheapgreedy - GoogleMediumSoftware EngineerMinimum Path Node Count with an Optional Broken Vertex
Find the minimum number of vertices on a path between two nodes in an unweighted graph while avoiding a designated broken vertex.
Coding & AlgorithmsOnsitegraphbfsshortest-path - GoogleMediumSoftware EngineerMost Active Users in a Live Communication Stream
This problem tests your ability to efficiently manage and rank real-time event counts using hash maps and balanced data structures or heaps, focusing on deduplication and stream processing.
Coding & AlgorithmsOnsiteHash MapsStream ProcessingData Structures - GoogleMediumData ScientistNormalize Columns in Binomial Matrix Efficiently
This question evaluates proficiency in matrix manipulation, handling of binomial random samples, column normalization, and algorithmic efficiency for processing large numerical arrays.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerOptimize 0/1 to bounded knapsack DP
This question evaluates mastery of dynamic programming for knapsack problems, focusing on state formulation, space-time optimization, and reconstructing optimal item sets.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerParse a Nested-List String and Compute Its Weighted Sum
Implement a parser that processes a string representation of a nested list and computes the depth-weighted sum of all non-negative integers contained within it.
Coding & AlgorithmsOnsiteString ParsingStackSimulation - GoogleMediumSoftware EngineerParse strings and find meeting slots
This question evaluates string parsing and data-extraction skills alongside set/array-based aggregation and algorithmic reasoning for calendar availability and time-window constraints.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerPredict the Most Frequent Next Word in Constant Time
Design and implement a next-word prediction class that builds transition frequencies from adjacent words in sequences and returns the most likely successor for a given word in average constant time.
Coding & AlgorithmsOnsiteHash TableDesignString - GoogleMediumSoftware EngineerRearrange Tasks With Cooldown
This problem tests your ability to manage dependencies and scheduling constraints using a greedy strategy with a priority queue.
Coding & AlgorithmsTechnical ScreenGreedyPriority QueueHash Map - GoogleHardSoftware EngineerRepeatedly Delete Leaves Matching a Target Value From a Binary Tree
Remove every binary-tree leaf whose value equals a target, repeating as parents turn into matching leaves, and return the possibly empty result in level-order form. It tests reasoning about cascading deletions, correct handling of the root, and edge cases such as matching internal nodes that keep a child.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerReturn Unique Three-Sum Value Triples
Return all unique value triples that reach a target using three distinct input positions, with canonical ordering despite duplicate values. Candidates are evaluated on duplicate control, overflow-safe sums, nonmutation, output-sensitive complexity, and careful boundary cases.
Coding & AlgorithmsOnsite
Google