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 571–600 of 1706 results

  • GoogleMediumSoftware Engineer
    Compute servers needed for daily recurring jobs

    This question evaluates understanding of interval-based resource allocation and job grouping by identifier, testing competency in managing overlapping time intervals, capacity planning, and handling day-boundary truncation.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Compute shortest paths with blocked nodes

    This question evaluates proficiency with graph algorithms, shortest-path and reachability concepts when nodes are removed or blocked, and the ability to analyze time and space complexity across directed and undirected graphs.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Compute sliding-window average excluding top k

    This problem tests your ability to maintain order statistics in a sliding window using balanced data structures or heaps to perform efficient removals and updates while excluding the top k elements.

    Coding & AlgorithmsTechnical ScreenSliding WindowOrder StatisticsData Structures
  • GoogleHardMachine Learning Engineer
    Construct connected crop layout and safe paths

    This problem tests your ability to design a constructive grid layout that satisfies connectivity and size constraints, followed by pathfinding through dynamic or constrained environments.

    Coding & AlgorithmsTechnical ScreenBacktrackingGraph TheoryBFS
  • GoogleMediumSoftware Engineer
    Count Clusters of 2D Points Within a Radius

    This problem tests your ability to model geometric data as a graph and identify connected components using traversal algorithms or Disjoint Set Union (DSU).

    Coding & AlgorithmsTechnical ScreenGraphsGeometryDFS/BFS
  • GoogleMediumSoftware Engineer
    Count 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
  • GoogleMediumSoftware Engineer
    Count 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
  • GoogleEasyData Scientist
    Count 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 Engineer
    Decide 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 Engineer
    Design 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 Engineer
    Design 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 Engineer
    Design 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
  • GoogleMediumSoftware Engineer
    Design 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 Engineer
    Design 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 Engineer
    Determine 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 Engineer
    Determine 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 Engineer
    Determine 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
  • GoogleMediumSoftware Engineer
    Expand 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 Engineer
    Filter 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 Engineer
    Find 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
  • GoogleMediumSoftware Engineer
    Find Containing Range

    This problem tests your ability to optimize interval lookup operations by preprocessing data into an efficient search structure to handle containment queries in sub-linear time.

    Coding & AlgorithmsTechnical ScreenIntervalsData StructuresBinary Search
  • GoogleHardSoftware Engineer
    Find Dictionary Matches for a Jammed String

    This problem tests your ability to normalize input strings by grouping consecutive identical characters and efficiently searching a dictionary for potential word matches.

    Coding & AlgorithmsTechnical ScreenStringsRun-Length EncodingPreprocessing
  • GoogleMediumSoftware Engineer
    Find Minimum Rooms Needed

    Tests interval processing, sorting, and tracking concurrent overlapping ranges using heaps or two-pointer sweep-line techniques.

    Coding & AlgorithmsTechnical Screenintervalssortingheap
  • GoogleMediumSoftware Engineer
    Find a Horizontal Cut That Bisects Rectangle Area

    Tests computational geometry and algorithmic efficiency by finding a horizontal line that bisects the total area of non-overlapping rectangles using sweep-line or binary search techniques.

    Coding & AlgorithmsTechnical Screengeometrysweep-linebinary-search
  • GoogleEasySoftware Engineer
    Find k pairs with smallest sums

    This question evaluates algorithmic problem-solving with ordered data structures, specifically understanding how to combine two sorted arrays efficiently, priority-queue or merge-based reasoning, and time/space complexity analysis in the coding and algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Find longest increasing contiguous subarray

    This problem tests your ability to use a sliding window or linear scan approach to identify contiguous subarrays and your capacity to optimize for a single modification to extend an existing sequence.

    Coding & AlgorithmsTechnical ScreenArraysSliding WindowGreedy
  • GoogleHardSoftware Engineer
    Find maximum value in huge text file

    This question evaluates a candidate's ability to design memory-efficient streaming algorithms and parallel processing strategies for extremely large files, covering skills in external-memory algorithms, file I/O, concurrency, and correctness under resource constraints.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Find median of merged RLE arrays

    This problem tests your ability to find the median of two sorted, run-length encoded arrays without fully decompressing them, focusing on efficiency and pointer manipulation.

    Coding & AlgorithmsTechnical ScreenArraysTwo PointersRun-Length Encoding
  • GoogleMediumSoftware Engineer
    Find mode in a trinary search tree

    This question evaluates a candidate's understanding of tree data structures and frequency analysis, focusing on handling a trinary search tree variant and determining mode values across possibly large datasets.

    Coding & AlgorithmsTechnical Screen
  • GoogleHardSoftware Engineer
    Find numbers with exactly two sum-of-squares forms

    This problem tests knowledge of the sum-of-two-squares theorem and efficient counting of integer partitions into two squares, requiring an understanding of number theory or optimization via circle/grid search.

    Coding & AlgorithmsTechnical ScreenNumber TheoryBrute ForceOptimization