Coding & Algorithms interview questions

Showing 1231–1260 of 3276 results

• Maintain k-th largest in a streamMedium

  This question evaluates understanding of data structures and streaming algorithms for maintaining k-th order statistics under dynamic inserts, emphasizing time-space trade-offs and correct handling of duplicates.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Maintain streaming median and loosemedianMedium

  This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Maintain streaming median and loosemedian states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Match Dictionary Words to a Swipe-Keyboard Gesture PathMedium

  A coding problem modeled on a swipe keyboard: given the ordered keys a finger passed over and a dictionary, return every word the gesture could spell. It tests precise handling of the start and end keys, doubled letters and duplicate words, and efficient matching of many dictionary words against one gesture path.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Match payments to invoices by memo or amountMedium

  This problem tests string parsing, hash-map based data indexing, and multi-criteria reconciliation logic (fuzzy matching via IDs vs. exact matching via amount).

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Match people to questions using tags and prioritiesMedium

  This problem tests your ability to model a constrained matching problem using greedy or flow-based approaches while managing priority queues for tie-breaking.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize 1D deliveries within distance and minimize total distanceMedium

  This problem tests your ability to prioritize objectives using a greedy strategy or sorting to maximize deliveries while minimizing travel cost within a constrained route.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Boundary-Difference Subarray SumMedium

  This question evaluates algorithmic problem-solving skills with emphasis on array processing, constrained subarray sums, and the design of time- and space-efficient algorithms within the Coding & Algorithms domain.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Maximize Throughput Packing Reserved Compute Slots With Limited StockMedium

  Choose how many reserved instances of each type to allocate into a shared rack-slot budget, each instance occupying exactly one slot, to maximize total throughput score given limited stock per type.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize coins collected by 3-step piecesMedium

  This question evaluates modeling and optimization of discrete state-space transitions under movement constraints, testing combinatorial reasoning, reachability, and resource-maximization competencies.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Maximize coins collected by tokens jumping +3Medium

  Evaluates algorithmic reasoning about constrained discrete moves and optimization, focusing on state-space modeling, reachability under move constraints, and resource-maximization techniques.

  GoogleSoftware EngineerCoding & AlgorithmsOnline Assessment
• Maximize sum without choosing adjacent elementsMedium

  This problem tests your ability to solve optimization challenges using dynamic programming by identifying overlapping subproblems and optimal substructure in an array.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize the Equal Wood Segment LengthMedium

  Tests the ability to solve an optimization problem by applying binary search over a monotonic search space (binary search on answer).

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Maximum Value from Unit-Weight Items with Limited Copies Under a CapacityMedium

  Find the maximum total value that fits in a bag whose capacity can reach one billion units, when every item weighs one unit and each item type has a value and a limited number of identical copies. Tests judging which knapsack techniques scale to huge capacities and copy counts, plus 64-bit arithmetic for large totals.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Two Named Trees: First Tree's Names and Order, Second Tree's ValuesHard

  Merge two trees whose nodes carry a name, an integer value and an ordered list of children, keeping the first tree's names and child order while taking values from the second. Same-name children pair up by order of appearance and second-tree leftovers are appended, testing careful recursive construction from a rule-heavy specification.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Min deletions to avoid overlap in first kMedium

  This problem tests your ability to identify and remove the minimum number of elements from an array such that a specified prefix contains only unique elements.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize Direction Violations in a Directed Road NetworkMedium

  Find the minimum number of edge reversals needed to travel from a source node to a target node in a directed graph. Tests graph modeling (0-1 weighted edges), edge cases like parallel edges and disconnected components, and efficient shortest-path traversal.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Minimize Fence Painting OperationsMedium

  This problem tests your ability to use a greedy approach or dynamic programming to find the minimum number of strokes required to paint a fence of varying heights.

  GoogleMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Minimize L2, L1, and quantile lossesMedium

  This question evaluates understanding of statistical estimators and optimization principles for L2, L1, and tilted absolute (quantile) loss functions, including use of derivatives and subgradients, order-statistics, algorithmic complexity, and robustness considerations.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Minimize maximum height along a grid pathHard

  This problem tests your ability to adapt shortest-path algorithms, such as Dijkstra's or Binary Search on the answer, to minimize the maximum edge/node weight along a path.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Cars for Rental RequestsMedium

  Determine the minimum number of rental cars required to service a given list of booking requests with half-open time intervals.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Minimum Path Node Count with an Optional Broken VertexMedium

  Find the minimum number of vertices on a path between two nodes in an unweighted graph while avoiding a designated broken vertex.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Most Active Users in a Live Communication StreamMedium

  This problem tests your ability to efficiently manage and rank real-time event counts using hash maps and balanced data structures or heaps, focusing on deduplication and stream processing.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Normalize Columns in Binomial Matrix EfficientlyMedium

  This question evaluates proficiency in matrix manipulation, handling of binomial random samples, column normalization, and algorithmic efficiency for processing large numerical arrays.

  GoogleData ScientistCoding & AlgorithmsTechnical Screen
• Optimize 0/1 to bounded knapsack DPMedium

  This question evaluates mastery of dynamic programming for knapsack problems, focusing on state formulation, space-time optimization, and reconstructing optimal item sets.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Parse a Nested-List String and Compute Its Weighted SumMedium

  Implement a parser that processes a string representation of a nested list and computes the depth-weighted sum of all non-negative integers contained within it.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Parse strings and find meeting slotsMedium

  This question evaluates string parsing and data-extraction skills alongside set/array-based aggregation and algorithmic reasoning for calendar availability and time-window constraints.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Predict the Most Frequent Next Word in Constant TimeMedium

  Design and implement a next-word prediction class that builds transition frequencies from adjacent words in sequences and returns the most likely successor for a given word in average constant time.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite
• Rearrange Tasks With CooldownMedium

  This problem tests your ability to manage dependencies and scheduling constraints using a greedy strategy with a priority queue.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Repeatedly Delete Leaves Matching a Target Value From a Binary TreeHard

  Remove every binary-tree leaf whose value equals a target, repeating as parents turn into matching leaves, and return the possibly empty result in level-order form. It tests reasoning about cascading deletions, correct handling of the root, and edge cases such as matching internal nodes that keep a child.

  GoogleSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return Unique Three-Sum Value TriplesMedium

  Return all unique value triples that reach a target using three distinct input positions, with canonical ordering despite duplicate values. Candidates are evaluated on duplicate control, overflow-safe sums, nonmutation, output-sensitive complexity, and careful boundary cases.

  GoogleSoftware EngineerCoding & AlgorithmsOnsite