Coding & Algorithms interview questions

Showing 1201–1230 of 3276 results

• Find the Time for Grid Signals to Reach Every TargetMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Find the nearest common manager of K employees in a reporting treeMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Find top-k distinct elementsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Find where to cut cake into equal areasMedium

  This problem tests your ability to model a geometric area as a function and solve for a specific threshold using a binary search or linear sweep approach.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate Every Ordered Sum Using Ones and TwosMedium

  Tests backtracking and recursion to generate all valid ordered compositions of a target integer using only digits 1 and 2 in lexicographical order.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Grid Reachability From Start to Target With Impassable Water CellsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Implement Batched Undo/Redo LayerEasy

  This question evaluates understanding of state management, undo/redo semantics, batched transactional edits, and memory-efficient change history representation for map-based document layers.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Checksums and Feature Rollout EvaluationMedium

  This question evaluates string processing, checksum computation with modular indexing, parsing of dependency data, and business-logic evaluation for feature rollouts, including conditional eligibility checks and dependency resolution.

  GoogleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement Longest-Match Text ReplacementHard

  This question evaluates string processing, pattern matching, greedy algorithm reasoning, and data structure design for efficient longest-prefix token replacement, and is categorized under Coding & Algorithms.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Multi-Player Tic-Tac-ToeMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Implement Sampling and Minimize Loss in Numerical CodingMedium

  This question evaluates proficiency in probability and numerical methods, focusing on sampling from truncated distributions and analytical properties of estimators under various loss functions.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement Trie Insert and Exact-Word SearchMedium

  Implement trie insertion and exact-word search for up to a million total characters, distinguishing terminal words from mere prefixes and returning search results in operation order.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Reusable Locker Allocation SystemMedium

  Design and implement a locker bank management system that assigns the lowest available locker index, handles invalid store and pickup operations, releases lockers immediately, and tracks the last package successfully stored in each locker.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a Transformer Block with SwiGLUMedium

  This question evaluates implementation and reasoning skills for Transformer internals, testing competency in multi-head self-attention, SwiGLU gated feed-forward layers, residual connections, and layer normalization within the Machine Learning / deep learning domain.

  GoogleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement an LRU cacheMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Implement anagram check and stable deduplicationMedium

  This question evaluates streaming algorithm design, Unicode normalization and locale-aware text processing, multiset frequency counting under tight time and memory bounds for an anagram checker, and stable, order-preserving deduplication with custom keys and NaN handling; it is in the Coding & Algorithms domain for a Data Scientist position.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement frequency + distance top‑K queriesMedium

  This pair of problems evaluates algorithmic and data-structure skills including frequency counting, multi-criteria ordering and selection for top-K results, geometric distance computation for tie-breaking, and time-indexed storage with nearest-timestamp retrieval.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement iterator merging lists with filteringMedium

  This problem tests your ability to design a stateful iterator that performs a multi-way merge on sorted streams while applying filtering and deduplication logic on the fly.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement longest subarray summing to kMedium

  This question evaluates proficiency in array algorithms, prefix-sum reasoning, hash-based lookup patterns, and careful handling of edge cases and deterministic tie-breaking.

  GoogleData ScientistCoding & AlgorithmsOnsite
• Implement percentage RMSE and bootstrap its CIMedium

  This question evaluates implementation and statistical reasoning skills, focusing on robust numerical computation of percentage RMSE (including handling zeros/negatives, optional country weights, and numerical stability) and nonparametric bootstrap methods for confidence intervals.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement piecewise linear interpolation for time-to-emptyMedium

  This question evaluates numerical interpolation, time-series data cleaning, monotonicity preservation, extrapolation, and numerical stability skills applied to battery discharge curves, and falls under coding and algorithms within a data science domain.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement sampling and subarray scanMedium

  This question evaluates probabilistic sampling and random-number transformation concepts for generating uniform points in a continuous domain, alongside array-processing and algorithmic analysis skills for identifying the longest strictly increasing contiguous subarray.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement sampling, subarray scan, and percentile estimateEasy

  This problem tests your ability to generate random uniform points within a geometric shape, process contiguous array properties using linear scans, and perform linear interpolation on histogram data to approximate percentiles.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Implement string formatting and request tracking tasksEasy

  This question tests string manipulation, character mapping logic for rotational symmetry, and the ability to manage time-ordered event tracking using appropriate data structures.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement substring search and weighted samplingMedium

  This question tests the ability to implement a fast substring matching algorithm and a data structure that supports weighted random sampling from a dynamic collection of items.

  GoogleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement text wrapping, waitlist, and intervalsMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Infection Spread on a Grid (Cellular Automaton)Hard

  Implement an optimized discrete-time cellular automaton simulating epidemic spread on a 2D grid with recovery durations, barriers, and multi-neighbor infection thresholds.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Intervals with Exactly X Concurrent MeetingsMedium

  Implement an algorithm to identify all maximal time intervals during which exactly X meetings overlap, using a sweep-line technique over half-open intervals.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Largest-Area Rectangle From a Point Set When Sides Need Not Be Axis-AlignedMedium

  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.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Load a Delivery Van With Equal-Size Crates for Maximum ProfitMedium

  Pick crates from limited stock to fill a van whose slots can number in the billions, when every crate takes one slot; recognize that the scary-looking bounded knapsack collapses to a greedy, then answer many capacity queries fast.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen