Coding & Algorithms interview questions

Showing 2941–2970 of 3276 results

• Build Quadtree and Find Grid WordsHard

  This problem tests your ability to implement a spatial partitioning data structure (Quadtree) for a grid and perform recursive searches to locate words within that grid efficiently.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Build a Quadtree and Analyze a GraphMedium

  This question evaluates skills in spatial data structures and recursive tree construction (building a quadtree) as well as graph analysis using traversal and cycle/safety detection to identify nodes that necessarily reach terminal nodes.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Can one car serve all riders?Medium

  This problem tests your ability to determine if a single resource (a car) can accommodate a series of scheduled tasks without overlap, requiring efficient sorting and comparison techniques.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Check feasibility of AI course scheduleHard

  This question evaluates competency in analyzing directed graphs and dependency resolution, focusing on cycle detection and the feasibility of ordering prerequisites for course completion.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Check if each prefix forms 1..k permutationHard

  This question evaluates algorithmic thinking and understanding of permutations and prefix invariants, measuring the ability to recognize when the first k elements of a permutation can form the set {1..k}.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Choose K pickup locations minimizing L1 distanceMedium

  This question evaluates facility-location and spatial optimization skills under the Manhattan (L1) metric, testing algorithm design, combinatorial optimization, and handling geometric data.

  UberMachine Learning EngineerCoding & AlgorithmsOnsite
• Compute CDF from a PDF FunctionMedium

  This problem tests your understanding of numerical integration techniques (specifically the trapezoidal rule) and your ability to implement a functional mapping of a continuous probability density function (PDF) into a discrete cumulative distribution function (CDF).

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Compute currency conversion via graph searchMedium

  This question evaluates graph modeling and pathfinding with weighted edges, numerical reasoning about multiplicative rates and floating-point precision, and the ability to analyze algorithmic time and space complexity.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Compute final prices with next smaller discountMedium

  This question evaluates array-processing and algorithmic problem-solving skills, focusing on reasoning about subsequent elements to compute element-wise discounts under input constraints.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute maximum concurrent trips from intervalsMedium

  This question evaluates a candidate's skill in designing efficient algorithms for interval overlap counting, including event ordering, handling half-open interval edge cases, and reasoning about concurrent activity timing.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Compute minimal time to finish dependent tasksMedium

  This question evaluates understanding of graph algorithms and scheduling, specifically reasoning about task dependencies, parallel execution, and cycle detection in directed graphs.

  UberMachine Learning EngineerCoding & AlgorithmsOnsite
• Compute outer boundary of an N-ary treeMedium

  This question evaluates proficiency in tree data structures and algorithm design, focusing on traversal and boundary extraction in ordered N-ary trees while requiring time and space complexity analysis.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute square root to 1 decimalMedium

  This question evaluates a candidate's understanding of numerical methods, floating-point precision, and implementation of approximate functions when producing a square root rounded to one decimal place.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Compute sums and maximum path in a treeMedium

  This problem tests your ability to perform post-order tree traversals to calculate subtree metrics and solve optimization problems involving paths that can span across parent-child boundaries.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute time for virus to infect gridMedium

  This question tests the ability to model state propagation in a 2D grid using a Breadth-First Search (BFS) approach to determine the minimum time required for a condition to cover all cells.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Convert a PDF to a CDFMedium

  This question evaluates understanding of probability theory, numerical methods, and algorithmic implementation for converting probability density functions into cumulative distribution functions, addressing analytic versus sampled PDFs along with support, normalization, and monotonicity requirements.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Count Islands After Each Land Addition to an All-Water GridHard

  A grid coding problem where land cells are added one at a time to an initially all-water grid and you must report the number of islands after every addition. It tests incremental connectivity, efficient merging of islands as they join, and correct handling of repeated additions.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Count Islands After Land AdditionsMedium

  This question tests the ability to manage connected components in a grid dynamically, specifically requiring an efficient approach to track changes after incremental land additions.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Count Islands of Connected Land Cells in a Binary GridHard

  A classic grid coding problem asking you to count the islands formed by horizontally or vertically connected land cells in a binary grid. It tests grid traversal, connected-component counting, and careful handling of grid boundaries and already visited cells.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Count Palindromic Ancestor PathsHard

  This problem tests your ability to use bit manipulation and prefix properties on trees to solve path-related queries efficiently, specifically focusing on the property that a set of characters can form a palindrome if at most one character has an odd frequency.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count Valid Infection OrdersMedium

  This problem tests your ability to use combinatorial counting and dynamic programming to determine the number of valid sequences in which a population can be infected under specific adjacency constraints.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Count connected delivery zonesMedium

  This question evaluates graph traversal and connected-components detection on grids, measuring competence in grid-based algorithms, neighbor connectivity, and algorithmic analysis of time and space complexity.

  UberMachine Learning EngineerCoding & AlgorithmsOnsite
• Count paths with prime-ending jumpsMedium

  This question evaluates a candidate's ability to design and implement dynamic programming for counting paths, combining combinatorial reasoning with modular arithmetic and handling step-size constraints tied to primes ending in digit 3.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count subarrays with at least k fruit pairsMedium

  This question evaluates algorithmic problem-solving focused on frequency-based counting and efficient enumeration of subarrays, testing competence in designing subquadratic solutions and selecting appropriate data representations within the Coding & Algorithms domain.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count subarrays with ≥k identical pairsMedium

  This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Deep Equality of Two RecordsMedium

  This problem tests your ability to recursively compare two complex, nested data structures while handling different types like dictionaries, lists, and primitives.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design airport dispatch with ETA uncertaintyMedium

  This question evaluates proficiency in online algorithm design under uncertainty, stochastic modeling of ETAs, multi-objective optimization for resource allocation, and streaming data handling relevant to dispatch systems.

  UberData ScientistCoding & AlgorithmsTechnical Screen
• Design top-K frequency structureMedium

  This question evaluates ability to design efficient in-memory data structures for frequency tracking, including handling recency-based tie-breaking, memory bounds under churn, and concurrency implications.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Design top-K tracker with linked listsMedium

  Design top-K tracker with linked lists evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Determine Whether a Word Exists in a Character GridHard

  Practice a Uber coding interview problem focused on determine whether a word exists in a character grid. The prompt emphasizes edge cases, clean implementation, and verifiable test behavior without revealing the solution.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen