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 1111–1140 of 3276 results

  • GoogleMediumSoftware Engineer
    Boolean Expression Tree with Leaf Flips

    This problem tests recursive tree evaluation logic and the ability to optimize updates by propagating changes only to necessary ancestors.

    Coding & AlgorithmsOnsiteTreesRecursionBoolean Logic
  • GoogleMediumSoftware Engineer
    Build Prefix Lookup with a Trie

    Tests implementation of a Trie (prefix tree) data structure to support word insertion, exact word search, prefix existence checks, and lexicographical autocomplete suggestions with a capacity limit.

    Coding & AlgorithmsTechnical Screentriestringsdfs
  • GoogleEasySoftware Engineer
    Build a next-word frequency predictor

    This problem tests your ability to process sequential text data, efficiently store word adjacency frequencies, and retrieve the most likely successor.

    Coding & AlgorithmsOnsiteHash MapData StructuresString Processing
  • GoogleEasyData Scientist
    Build next-word predictor with O(1) lookup

    This problem tests your ability to design a memory-efficient data structure for storing n-gram probabilities and performing fast lookups for the most likely next word.

    Coding & AlgorithmsOnline AssessmentHash MapData StructuresNLP
  • GoogleEasySoftware Engineer
    Busiest Rental Car

    This problem tests your ability to manage state and apply custom sorting logic to simulate resource allocation across time intervals.

    Coding & AlgorithmsOnsiteHash MapSimulationGreedy
  • GoogleMediumSoftware Engineer
    Calculate Highway Tolls from Ordered Checkpoint Logs

    Tests tracking vehicle state across interleaved chronological event streams and computing distance-based segment tolls regardless of travel direction or checkpoint repetition.

    Coding & AlgorithmsOnsitehash-tablearrayssimulation
  • GoogleMediumSoftware Engineer
    Can board states be transformed?

    This problem tests your ability to determine if one board state can be transformed into another using reversible movement rules, requiring the identification of invariants to avoid exhaustive searching.

    Coding & AlgorithmsTechnical ScreenStringsInvariantsTwo Pointers
  • GoogleMediumSoftware Engineer
    Check Whether Digits Are Monotone Increasing

    Determine if a non-negative integer has digits that are monotonically non-decreasing from left to right, handling edge cases without unnecessary memory allocation.

    Coding & AlgorithmsTechnical Screenmathstringsfundamentals
  • GoogleEasySoftware Engineer
    Check an Interval Against Existing Intervals for Conflicts

    Determine whether a proposed half-open interval overlaps with any interval in an unsorted list. This tests basic interval overlap logic and boundary condition handling.

    Coding & AlgorithmsTechnical ScreenIntervalsArraysGeometry
  • GoogleMediumSoftware Engineer
    Check if all substrings are anagrams of words

    This question evaluates string-processing skills and combinatorial reasoning about character multisets, specifically anagram recognition, substring enumeration, and the use of efficient representations for repeated checks.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Check if all substrings are dictionary words

    This question evaluates string-processing skills such as substring enumeration and membership testing against a dictionary, along with algorithmic reasoning about correctness and complexity.

    Coding & AlgorithmsTechnical Screen
  • GoogleMediumSoftware Engineer
    Choose Non-Overlapping Weighted Jobs to Maximize Total Profit

    Choose a set of jobs, each with a start time, end time and profit, so that no two chosen jobs overlap and the total profit is as large as possible. It tests sorting intervals, defining an optimal-substructure recurrence, and finding the latest compatible earlier job efficiently for large inputs.

    Coding & AlgorithmsOnsite
  • GoogleMediumSoftware Engineer
    Choose One Blocker Removal for the Fastest Grid Signals

    Determine at most one obstacle to remove in a grid to minimize the maximum time for signals to reach all target cells from multiple sources.

    Coding & AlgorithmsOnsiteBFSGraphMatrix
  • GoogleMediumSoftware Engineer
    Choose optimal guesses for green-only Wordle

    This problem tests your ability to model uncertainty and implement a greedy strategy to minimize the expected search space size when provided with restricted (green-only) feedback.

    Coding & AlgorithmsTechnical ScreenProbabilityGreedyOptimization
  • GoogleHardSoftware Engineer
    Compute Turnstile Crossing Times

    This problem tests your ability to manage state in a queue-based simulation and implement complex tie-breaking logic using data structures like heaps or prioritized queues.

    Coding & AlgorithmsTechnical ScreenSimulationQueueHeap
  • GoogleMediumSoftware Engineer
    Compute a Depth-Weighted Sum of a Nested List

    Implement and compare recursive and iterative traversals to compute the depth-weighted sum of an arbitrarily nested list of integers, handling deep nesting and edge cases.

    Coding & AlgorithmsOnsitedfsbfsstack
  • GoogleMediumSoftware Engineer
    Compute distance to nearest taxi in grid

    This problem tests your ability to efficiently compute shortest path distances from multiple sources to all reachable grid cells using multi-source Breadth-First Search (BFS).

    Coding & AlgorithmsTechnical ScreenBFSGraphGrid
  • GoogleEasySoftware Engineer
    Compute max coins with 3-step token moves

    This question evaluates combinatorial optimization, state-space reasoning, and algorithmic design for constrained token movements on a linear board, and falls under the Coding & Algorithms domain.

    Coding & AlgorithmsOnline Assessment
  • GoogleHardSoftware Engineer
    Compute minimax grid path and network delay

    This question tests the ability to solve pathfinding problems using non-standard cost metrics: first, finding a minimax path in a grid, and second, calculating the earliest arrival time in a network with weighted edges.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingDijkstraBinary Search
  • GoogleMediumSoftware Engineer
    Compute minimum servers for cyclic tasks

    This problem tests your ability to manage overlapping intervals in a circular domain by converting cyclic tasks into linear sub-intervals and applying a sweep-line or greedy approach to determine resource requirements.

    Coding & AlgorithmsTechnical ScreenIntervalsGreedySweep-line
  • GoogleMediumData Scientist
    Compute precision–recall curve on imbalanced data

    This question evaluates a data scientist's competency in model evaluation for imbalanced binary classification, covering understanding of precision–recall dynamics, calibration, AUPRC, cost‑sensitive metrics, and practical implementation concerns like computing thresholds and handling ties and numerical edge cases; domain: Coding & Algorithms and machine learning model evaluation. It is commonly asked in technical interviews because it assesses both conceptual understanding of evaluation trade‑offs and the practical application of efficient, robust metric computation and threshold selection under asymmetric costs and operational constraints.

    Coding & AlgorithmsTechnical Screen
  • 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 delivery route with dangerous stops

    This question evaluates understanding of graph traversal and shortest-path techniques under constraints, including avoidance of forbidden nodes, multi-criteria optimization (minimizing dangerous-node visits then steps), and reasoning about augmented state and visited-structure design.

    Coding & AlgorithmsOnsite
  • 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
  • GoogleMediumMachine Learning Engineer
    Compute sum over consecutive-step subarrays

    This problem tests your ability to identify contiguous subarrays that follow an arithmetic progression with a common difference of 1 (consecutive steps) and calculate the sum of elements within these subarrays efficiently.

    Coding & AlgorithmsOnsiteArraysMathSliding Window
  • GoogleMediumSoftware Engineer
    Compute the Union of Two Sorted Interval Lists

    Merge two sorted lists of disjoint closed intervals into a single sorted list of disjoint intervals in linear time.

    Coding & AlgorithmsOnsiteIntervalsTwo PointersMerge Sort
  • GoogleMediumSoftware Engineer
    Consolidate On-Call Rotation Segments

    Consolidate overlapping on-call shift intervals into non-overlapping segments, each annotated with the sorted list of active engineers.

    Coding & AlgorithmsOnline Assessmentintervalsweep-linesorting
  • 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