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 391–420 of 1080 results
- GoogleMediumSoftware EngineerDetermine validity after digit-constrained deletions
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Determine validity after digit-constrained deletions states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - GoogleEasySoftware EngineerDeterministic Task Execution Order
This question tests the ability to implement Kahn's algorithm for topological sorting while using a min-priority queue to satisfy specific tie-breaking requirements.
Coding & AlgorithmsOnsiteGraphsTopological SortPriority Queue - GoogleMediumSoftware EngineerEarliest Time of Full Connectivity
Determine the earliest timestamp at which all nodes in a network become part of a single connected component using a chronological sequence of edge additions.
Coding & AlgorithmsOnsitegraphunion-findsorting - GoogleEasySoftware EngineerFind Common Free Time Slots Across Calendars
Tests your ability to process and merge multiple sets of time intervals to find mutually available time windows within a given working day.
Coding & AlgorithmsOnsiteintervalssortingsweep-line - GoogleMediumSoftware EngineerFind Earliest Fully Connected Time
This problem tests your ability to efficiently track the connectivity of a graph as edges are added over time, requiring an understanding of Union-Find data structures and graph theory.
Coding & AlgorithmsOnsiteGraphDSUSorting - GoogleMediumSoftware EngineerFind Paths Across a Weighted Binary Grid
Implement algorithms to analyze top-to-bottom paths in a blocked, cell-weighted grid: reachability check, deterministic path enumeration, and minimum-cost path finding with lexicographic tie-breaking.
Coding & AlgorithmsOnsiteGraphBFS/DFSDijkstra - GoogleMediumSoftware EngineerFind Shortest Queue with Few Calls
This problem tests your ability to optimize search operations across multiple data sources, focusing on minimizing high-latency API calls by using heuristic strategies and efficient state management.
Coding & AlgorithmsOnsiteAlgorithmsOptimizationHeuristics - GoogleHardSoftware EngineerFind best-matching binary pattern with wildcards
This problem tests your ability to efficiently match a query string against a dictionary of patterns containing wildcards and determine the best match based on predefined precedence rules.
Coding & AlgorithmsOnsiteStringsPattern MatchingGreedy - GoogleMediumSoftware EngineerFind cheapest common ancestor in a tree
This problem tests your ability to navigate tree structures and perform post-order traversal to identify an ancestor node based on a custom aggregate criterion (the minimum value).
Coding & AlgorithmsOnsiteTreesRecursionLCA - GoogleHardSoftware EngineerFind conflicting pair using black-box run()
This problem tests your ability to optimize search operations within a hidden set of dependencies by minimizing calls to a costly black-box oracle.
Coding & AlgorithmsOnsiteBinary SearchQuery ComplexityAlgorithms - GoogleMediumSoftware EngineerFind horizontal cut balancing square areas
This question evaluates computational geometry and algorithm design skills, focusing on area computation, monotonicity reasoning, existence proofs, root-finding under floating-point constraints, and considerations of numerical stability and complexity.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerFind shortest path with blocked nodes
This question evaluates proficiency in graph traversal and shortest-path computation, including handling nodes that are blocked or that incur additional costs. It is commonly asked in the coding and algorithms domain (graph algorithms) to assess both practical implementation skills and conceptual understanding of complexity, edge cases, and trade-offs between unweighted and weighted path models.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerFind the Longest Consecutive Path in a Binary Tree
Practice a Google coding interview problem focused on find the longest consecutive path in a binary tree. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerFind the Longest Continuous Increasing Subsequence
Tests array traversal, state tracking, and boundary handling to find the maximum length of a contiguous, strictly increasing run in linear time.
Coding & AlgorithmsOnsiteArraysTwo PointersSliding Window - GoogleMediumSoftware EngineerFind the Longest Path of Equal-Valued Tree Nodes
This problem tests tree traversal techniques and dynamic programming on trees, specifically how to track path lengths across subtree boundaries using a recursive helper function.
Coding & AlgorithmsOnsiteBinary TreesRecursionDFS - GoogleMediumSoftware EngineerFind the Time for Grid Signals to Reach Every Target
Implement a multi-source breadth-first search to find the minimum time needed for signals emitted from multiple sources to reach all target cells on a grid with obstacles.
Coding & AlgorithmsOnsiteBFSMulti-Source BFSGrid - GoogleMediumSoftware EngineerFind the nearest common manager of K employees in a reporting tree
Given a company reporting tree in which every employee except the top one has a single direct manager, find the nearest manager shared by a list of K employees, counting each employee as part of their own chain. Tests tree reasoning, ancestor chains and very deep hierarchies.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerFind top-k distinct elements
This question tests the ability to combine frequency counting with heap-based selection to extract the k most frequent distinct elements from an input stream.
Coding & AlgorithmsOnsiteHash TableHeapSorting - GoogleMediumSoftware EngineerGenerate Every Ordered Sum Using Ones and Twos
Tests backtracking and recursion to generate all valid ordered compositions of a target integer using only digits 1 and 2 in lexicographical order.
Coding & AlgorithmsOnsiteRecursionBacktrackingCombinatorics - GoogleMediumSoftware EngineerGrid Reachability From Start to Target With Impassable Water Cells
Decide whether a start cell can reach a target cell in a square grid when some cells are water and moves are limited to up, down, left and right. It tests modeling a grid as a graph, choosing a traversal, and handling walled-off regions and grid edges correctly.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerImplement Multi-Player Tic-Tac-Toe
This problem tests object-oriented design and grid traversal logic by requiring the implementation of a generic N-player Tic-Tac-Toe game where win conditions are evaluated based on a specific run-length.
Coding & AlgorithmsOnsiteOOPGridGame Design - GoogleMediumSoftware EngineerImplement an LRU cache
This question evaluates competency in data structure design and algorithmic complexity by requiring a bounded key-value cache with O(1) average-time get and put operations.
Coding & AlgorithmsOnsite - GoogleMediumData ScientistImplement longest subarray summing to k
This question evaluates proficiency in array algorithms, prefix-sum reasoning, hash-based lookup patterns, and careful handling of edge cases and deterministic tie-breaking.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerImplement text wrapping, waitlist, and intervals
This problem tests your ability to implement a greedy word-wrapping algorithm and a custom queue data structure that supports efficient deletions based on time intervals.
Coding & AlgorithmsOnsiteGreedyString ManipulationData Structures - GoogleMediumSoftware EngineerIntervals with Exactly X Concurrent Meetings
Implement an algorithm to identify all maximal time intervals during which exactly X meetings overlap, using a sweep-line technique over half-open intervals.
Coding & AlgorithmsOnsitesweep-lineintervalssorting - GoogleMediumSoftware EngineerLargest-Area Rectangle From a Point Set When Sides Need Not Be Axis-Aligned
Given distinct integer points in the plane, return the largest area of a rectangle whose four corners are input points, where the rectangle may be rotated rather than aligned with the axes. It tests the geometric characterization of rectangles, grouping point pairs efficiently, and exact integer arithmetic.
Coding & AlgorithmsOnsite - 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 - 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
Google