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 1141–1170 of 3276 results
- GoogleMediumSoftware EngineerCount Connected Clusters of Two-Dimensional Points
Tests modeling geometric proximity as a graph problem, using Disjoint Set Union or graph traversal to identify connected components while ensuring exact integer arithmetic and handling duplicate coordinates.
Coding & AlgorithmsTechnical Screengraphsunion-findgeometry - GoogleHardFrontend EngineerCount Islands with Diagonal Connectivity
Practice counting binary-grid components when diagonal neighbors connect, changing the usual four-direction island definition.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerCount Prefix-Matching Simple Paths in a Labeled Graph
Tests graph traversal, bitmask dynamic programming or backtracking with pruning, and prefix counting on small labeled graphs.
Coding & AlgorithmsTechnical Screengraphbitmask-dpbacktracking - GoogleEasySoftware EngineerCount Rectangle Coverage on a Grid
Implement an algorithm to compute cell-by-cell coverage counts for an n x n grid given multiple inclusive rectangular regions.
Coding & AlgorithmsOnsitematrixprefix-sumdifference-array - GoogleMediumSoftware EngineerCount Up-Right/Right/Down-Right Grid Paths Through Ordered Checkpoints
Count the paths across an n by m grid from the bottom-left to the bottom-right cell when each move goes up-right, right or down-right, optionally passing through checkpoints in a required order, modulo a large prime. It tests column-by-column dynamic programming and reducing memory use.
Coding & AlgorithmsOnsite - GoogleEasyData ScientistCount super-streak segments in an event stream
Count super-streak segments in a time-ordered event stream with an O(n) scan. The solution explains maximal segment boundaries, inclusive gap handling, duration and count checks, edge cases, streaming behavior, and changing-threshold follow-ups.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerCount user sessions from logs
This question evaluates a candidate's ability to parse and process large-scale event logs, perform sessionization based on time gaps, handle out-of-order records and memory constraints, and reason about time and space complexity and optimization strategies in the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - GoogleMediumSoftware EngineerDecide string transform with directional tokens and walls
Decide string transform with directional tokens and walls evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerDecompress encoded string with nested repeats
This question tests the ability to handle nested structures using recursion or a stack-based approach to expand string patterns based on repetition factors.
Coding & AlgorithmsOnsiteStackRecursionString Manipulation - GoogleMediumSoftware EngineerDependency-Safe Deletion Order
Tests directed graph modeling, cycle detection, and Kahn's algorithm using a min-heap to produce a lexicographically smallest topological sort.
Coding & AlgorithmsOnsiteTopological SortHeapGraph - GoogleMediumSoftware EngineerDesign Tic-Tac-Toe With K Players
This question evaluates a candidate's ability to design and implement a game engine, manage board state and turn logic, validate moves, and apply efficient data structures and algorithms for win detection within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerDesign a logger that returns top-K messages
Design an in-memory message logger that records timestamped messages and queries the top-K most frequent messages within any given time range.
Coding & AlgorithmsTechnical Screendesignhash-tableheap - GoogleMediumSoftware EngineerDesign a rolling hit counter API
This question tests the ability to design an efficient data structure for time-series aggregation using a sliding window approach with O(1) time complexity per operation.
Coding & AlgorithmsTechnical ScreenData StructuresConcurrencyDesign - GoogleEasySoftware EngineerDesign compressed vector and compute dot product
This problem tests your ability to design a memory-efficient data structure for sparse or repetitive vector data and implement an arithmetic operation without fully decompressing the representation.
Coding & AlgorithmsOnsiteArraysTwo PointersData Structures - GoogleMediumSoftware EngineerDesign server allocation for multi-type nodes
This question evaluates understanding of scalable resource-allocation and matching systems, encompassing data-structure and index design, availability tracking, fragmentation minimization, concurrency control, and failure handling for large node pools.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerDesign set with O(1) random access
This question evaluates skill in designing a composite data structure that supports average O(1) insertion, deletion, and uniform random access, and tests understanding of hashing, indexing, randomness, and concurrency control.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerDesign structure for insert and k-th largest
This problem tests your ability to design a dynamic data structure that maintains elements while efficiently querying the k-th largest value, necessitating a balance between insertion speed and retrieval performance.
Coding & AlgorithmsOnsiteData StructuresHeapBinary Search Tree - GoogleMediumSoftware EngineerDetermine All Players with Fixed Rankings
Determine which players in a competition have a uniquely determined ranking given a set of pairwise match outcomes.
Coding & AlgorithmsOnsitegraphbfsdfs - GoogleMediumSoftware EngineerDetermine Reporting Relationships
This question evaluates understanding of hierarchical relationship modeling, transitive inference across relations, and dynamic data-structure design for tracking manager and peer links.
Coding & AlgorithmsTechnical Screen - GoogleMediumSoftware EngineerDetermine Whether a Word Exists in a Graph
This problem tests the ability to implement a depth-first search (DFS) with backtracking to find a specific sequence within a grid, while managing state to avoid reusing the same path.
Coding & AlgorithmsOnsiteDFSBacktrackingGraphs - 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 - GoogleMediumSoftware EngineerDetermine whether two nodes are related
This problem tests your ability to determine connectivity between two nodes in a directed graph, specifically modeling ancestry relationships.
Coding & AlgorithmsTechnical ScreenGraphsDFSBFS - GoogleHardSoftware EngineerDetermine winner in stack-merging game
This problem tests your ability to model a combinatorial game using the Sprague-Grundy theorem and memoization to determine the winner of a state-dependent stack-merging process.
Coding & AlgorithmsTechnical ScreenGame TheoryRecursionMemoization - 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 - GoogleMediumSoftware EngineerEvaluate a Lisp-Style Expression Language with let, add and mult Scoping
A Google coding problem asking you to evaluate a small Lisp-like expression language with integer literals, variables, and add, mult and let forms. It tests tokenizing and parsing nested expressions, lexical scoping in which inner bindings shadow outer ones, and sequential rebinding inside a let.
Coding & AlgorithmsOther - GoogleMediumSoftware EngineerExpand Recursive Key-Value Placeholders in a Template
Implement a template engine that recursively resolves variable placeholders using a key-value dictionary while handling circular dependencies, missing keys, and escaped characters.
Coding & AlgorithmsTechnical Screenstringgraphdfs - GoogleMediumSoftware EngineerFilter Repeated Robot Status Messages
Design an algorithm to rate-limit and deduplicate a stream of robot status messages so identical messages only display if strictly more than ten seconds have elapsed since their last displayed occurrence.
Coding & AlgorithmsTechnical ScreenHash TableDesignRate Limiting - GoogleMediumSoftware EngineerFind A Threshold-Limited Path With Minimum Required Safety
Find the minimum security clearance needed to travel between two nodes in a graph where edges exceeding a given latency threshold cannot be used.
Coding & AlgorithmsTechnical ScreenGraphDijkstraHeap - 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
Google