Coding & Algorithms interview questions

Showing 3181–3210 of 3276 results

• Is the Segment From 0 to 50 Fully Contaminated After Each Landing Point?Medium

  Points land one at a time on the segment from 0 to 50, each contaminating an interval of length 1 around it; after each landing, report whether the whole segment is contaminated. Tests interval union maintenance, exact boundary handling and efficient updates.

  WaymoSite Reliability EngineerCoding & AlgorithmsOnsite
• Lowest Horizontal Cut That Splits Square Cakes Into Equal Total AreasMedium

  Square cakes sit on a table with sides parallel to its edges; find the lowest horizontal cut line that splits the total cake area equally, returned as an exact fraction. Tests sweeping over heights, piecewise-linear area accumulation and exact arithmetic.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Minimize Total Grid Distance to Every BuildingMedium

  Find an empty land cell in a 2D grid that minimizes the sum of shortest travel distances to all buildings without traversing through obstacles or other buildings.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Return All Words Matching Each Prefix From a Word ListMedium

  Build a structure over a word list that answers prefix queries, returning every distinct word that starts with each prefix in lexicographic order. Tests prefix-tree design, deduplication, and answering many queries without rescanning the whole list.

  WaymoMachine Learning EngineerCoding & AlgorithmsOnsite
• Sample Points Uniformly from a Unit DiskMedium

  Derive uniform random sampling inside a unit disk, explain the radial distribution, and compare a polar sampler with rejection sampling.

  WaymoData ScientistCoding & AlgorithmsTechnical Screen
• Sort the Results of Applying a Quadratic Function to a Sorted ArrayMedium

  Apply the quadratic function a*x*x + b*x + c to every element of a sorted integer array and return the results in sorted order, where a may be negative or zero. Tests reasoning about the parabola's shape and merging values from both ends in linear time.

  WaymoSoftware EngineerCoding & AlgorithmsOnsite
• Validate a Parent-Child ForestMedium

  This problem tests graph theory fundamentals by requiring the validation of a forest structure, specifically checking for cycle-free properties and valid parent-child node connectivity constraints.

  WaymoSoftware EngineerCoding & AlgorithmsTechnical Screen
• Expand algebraic expression with distributionMedium

  This question evaluates parsing of algebraic expressions, application of the distributive law, string manipulation, and algorithmic reasoning about time and extra-space complexity.

  WeRideSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Several Core Algorithmic ComponentsMedium

  This problem tests your ability to implement fundamental algorithms, including caching mechanisms, probability transformations, and geometric counting patterns.

  WeRideSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement expression expansion to plus-only formMedium

  This question evaluates understanding of expression parsing and algebraic expansion via the distributive property, along with skills in string manipulation, stack-managed state for nested parentheses, and time/space complexity analysis.

  WeRideSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement matrix multiplication and fast exponentiationMedium

  This question evaluates competency in matrix multiplication, modular arithmetic, and exponentiation algorithms as applied to large-scale numeric computations such as sequence generation.

  WeRideSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate Bracket SequenceMedium

  This problem tests the ability to manage nested structures using a stack to ensure that all opening brackets are closed in the correct order and type.

  WeRideSoftware EngineerCoding & AlgorithmsOnline Assessment
• Build User Journey Path SummaryHard

  This question evaluates the ability to transform unordered user action logs into a trie-like path tree, exercising skills in grouping and time-sorting per user, maintaining stable insertion order, counting distinct users per prefix, and producing deterministic preorder string output.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Tic-Tac-Toe AppMedium

  This question evaluates proficiency in interactive UI development and stateful game logic, including turn management, board state representation, win/draw detection, input validation, and reset flow.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Check Whether a String Can Become a Palindrome by Deleting at Most One CharacterEasy

  A string coding problem that asks whether a lowercase string can be turned into a palindrome by deleting at most one character, returning a boolean. It tests careful handling of mismatched characters, strings that are already palindromes, and an efficient solution for strings of up to 100,000 characters.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Content Safety FilterMedium

  Tests string tokenization, interval tracking, and Trie-based multi-word pattern matching to redact prohibited phrases from live-stream messages.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count User Journey PrefixesEasy

  Process timestamped user activity logs to reconstruct chronological action sequences and count the frequency of user journey prefixes up to length k.

  WhatnotSoftware EngineerCoding & AlgorithmsOnline Assessment
• Dot Product of Two Vectors (Dense, then Sparse)Medium

  Tests data structure design and algorithmic optimization for sparse vector operations, transitioning from standard array traversal to pointer-based or hash-based solutions that scale with non-zero elements.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Knight Dialer: Count Dialable Digit SequencesMedium

  Calculate the number of distinct n-digit phone numbers reachable by standard chess knight moves on a numeric keypad, modulo 10^9 + 7.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Merge Two Sorted ArraysHard

  Implement a linear-time merge of two sorted arrays into a new sorted array using two pointers, preserving duplicates without modifying the input arrays.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Remove All Adjacent Duplicate PairsHard

  Implement an algorithm to repeatedly eliminate adjacent identical character pairs from a string until no adjacent duplicates remain, handling Unicode inputs in linear time.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Repeatedly Delete Adjacent Duplicate Pairs or Whole Runs of Equal CharactersEasy

  A string coding problem with two modes: repeatedly delete pairs of equal adjacent characters, or, as the follow-up, delete whole runs of equal adjacent characters, always the leftmost run first, and return what remains. It tests simulating cascading deletions efficiently and handling runs that merge after a deletion.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Adjacent-Deletion and Sorted-Square ProblemsEasy

  This question evaluates skills in string manipulation and pattern-removal algorithms for adjacent duplicates and k-sized group deletions, as well as array processing and merging techniques for producing sorted squares; it tests understanding of relevant data-structure concepts and merging/two-pointer strategies within the Coding & Algorithms domain. It is commonly asked to assess algorithmic efficiency, correctness under large input constraints and tricky edge cases (such as cascading deletions and negative values), and is primarily a practical implementation task that emphasizes complexity analysis over purely theoretical reasoning.

  WhatnotSoftware EngineerCoding & AlgorithmsTechnical Screen
• Build a Fuzzy Keyword IndexMedium

  This problem tests your ability to design an efficient data structure for performing fuzzy keyword lookups using edit distance constraints on a static corpus of strings.

  WorkdaySoftware EngineerCoding & AlgorithmsOnsite
• Count Unordered Combinations of Unlimited CoinsMedium

  Count distinct ways to reach a target with unlimited coins, treating different orders of the same denominations as one combination.

  WorldquantSoftware EngineerCoding & AlgorithmsOnline Assessment
• Build a Least-Recently-Used StoreMedium

  This question evaluates understanding of caching and eviction policies and practical proficiency with data structures such as hash tables and ordered collections for tracking and updating recency.

  XPengData EngineerCoding & AlgorithmsTechnical Screen
• Implement Stable SoftmaxMedium

  This question tests the ability to implement a numerically stable softmax function by handling potential floating-point overflows or underflows common in high-dimensional vector exponentiation.

  XPengSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Unique Element in PairsMedium

  This problem tests your ability to use binary search on a sorted array to find a unique element where all other elements appear in identical pairs.

  XiaohongshuSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximum Profit from One Stock Purchase and a Later SaleMedium

  This problem tests the ability to solve the 'best time to buy and sell stock' pattern in O(n) time and O(1) space, identifying the minimum price seen so far to calculate potential profit.

  XiaohongshuSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maintain the Median of a Data StreamMedium

  This problem tests the ability to maintain dynamic statistics in a data stream using efficient data structures to achieve optimal insertion and retrieval times.

  XiaopengSoftware EngineerCoding & AlgorithmsTechnical Screen