Coding & Algorithms interview questions

Showing 1111–1140 of 3276 results

• Boolean Expression Tree with Leaf FlipsMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Build Prefix Lookup with a TrieMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a next-word frequency predictorEasy

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

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Build next-word predictor with O(1) lookupEasy

  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.

  GoogleData ScientistCoding & AlgorithmsOnline Assessment
• Busiest Rental CarEasy

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

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Calculate Highway Tolls from Ordered Checkpoint LogsMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Can board states be transformed?Medium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check Whether Digits Are Monotone IncreasingMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check an Interval Against Existing Intervals for ConflictsEasy

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check if all substrings are anagrams of wordsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check if all substrings are dictionary wordsMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Choose Non-Overlapping Weighted Jobs to Maximize Total ProfitMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Choose One Blocker Removal for the Fastest Grid SignalsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Choose optimal guesses for green-only WordleMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Turnstile Crossing TimesHard

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute a Depth-Weighted Sum of a Nested ListMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Compute distance to nearest taxi in gridMedium

  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).

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute max coins with 3-step token movesEasy

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute minimax grid path and network delayHard

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute minimum servers for cyclic tasksMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute precision–recall curve on imbalanced dataMedium

  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.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Compute servers needed for daily recurring jobsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute shortest delivery route with dangerous stopsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Compute shortest paths with blocked nodesMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute sliding-window average excluding top kMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute sum over consecutive-step subarraysMedium

  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.

  GoogleMachine Learning EngineerCoding & AlgorithmsOnsite
• Compute the Union of Two Sorted Interval ListsMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Consolidate On-Call Rotation SegmentsMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Construct connected crop layout and safe pathsHard

  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.

  GoogleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Count Clusters of 2D Points Within a RadiusMedium

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

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen