practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 2941–2970 of 3276 results
- UberHardSoftware EngineerBuild Quadtree and Find Grid Words
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.
Coding & AlgorithmsOnsiteQuadtreeBacktrackingTrie - UberMediumSoftware EngineerBuild a Quadtree and Analyze a Graph
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.
Coding & AlgorithmsTechnical Screen - UberMediumData ScientistCan one car serve all riders?
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.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - UberHardSoftware EngineerCheck feasibility of AI course schedule
This question evaluates competency in analyzing directed graphs and dependency resolution, focusing on cycle detection and the feasibility of ordering prerequisites for course completion.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerCheck if each prefix forms 1..k permutation
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}.
Coding & AlgorithmsOnline Assessment - UberMediumMachine Learning EngineerChoose K pickup locations minimizing L1 distance
This question evaluates facility-location and spatial optimization skills under the Manhattan (L1) metric, testing algorithm design, combinatorial optimization, and handling geometric data.
Coding & AlgorithmsOnsite - UberMediumData ScientistCompute CDF from a PDF Function
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).
Coding & AlgorithmsTechnical ScreenNumerical MethodsProbabilityIntegration - UberMediumMachine Learning EngineerCompute currency conversion via graph search
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.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerCompute final prices with next smaller discount
This question evaluates array-processing and algorithmic problem-solving skills, focusing on reasoning about subsequent elements to compute element-wise discounts under input constraints.
Coding & AlgorithmsOnline Assessment - UberMediumData ScientistCompute maximum concurrent trips from intervals
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.
Coding & AlgorithmsTechnical Screen - UberMediumMachine Learning EngineerCompute minimal time to finish dependent tasks
This question evaluates understanding of graph algorithms and scheduling, specifically reasoning about task dependencies, parallel execution, and cycle detection in directed graphs.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerCompute outer boundary of an N-ary tree
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.
Coding & AlgorithmsTechnical Screen - UberMediumData ScientistCompute square root to 1 decimal
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.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerCompute sums and maximum path in a tree
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.
Coding & AlgorithmsOnline AssessmentTreesRecursionDFS - UberMediumSoftware EngineerCompute time for virus to infect grid
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.
Coding & AlgorithmsTechnical ScreenBFSGraphGrid - UberMediumData ScientistConvert a PDF to a CDF
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.
Coding & AlgorithmsTechnical Screen - UberHardSoftware EngineerCount Islands After Each Land Addition to an All-Water Grid
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.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerCount Islands After Land Additions
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.
Coding & AlgorithmsOnsiteGraphsDSUData Structures - UberHardSoftware EngineerCount Islands of Connected Land Cells in a Binary Grid
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.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerCount Palindromic Ancestor Paths
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.
Coding & AlgorithmsOnline AssessmentBit ManipulationTreesDFS - UberMediumSoftware EngineerCount Valid Infection Orders
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.
Coding & AlgorithmsOnsiteDynamic ProgrammingCombinatoricsAlgorithms - UberMediumMachine Learning EngineerCount connected delivery zones
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.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerCount paths with prime-ending jumps
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with at least k fruit pairs
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.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerCount subarrays with ≥k identical pairs
This question evaluates proficiency in array algorithms, frequency-based counting and combinatorial reasoning for identifying equal-element pairs within contiguous subarrays.
Coding & AlgorithmsOnline Assessment - UberMediumSoftware EngineerDeep Equality of Two Records
This problem tests your ability to recursively compare two complex, nested data structures while handling different types like dictionaries, lists, and primitives.
Coding & AlgorithmsTechnical ScreenRecursionData StructuresHash Maps - UberMediumData ScientistDesign airport dispatch with ETA uncertainty
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.
Coding & AlgorithmsTechnical Screen - UberMediumSoftware EngineerDesign top-K frequency structure
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.
Coding & AlgorithmsOnsite - UberMediumSoftware EngineerDesign top-K tracker with linked lists
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.
Coding & AlgorithmsOnsite - UberHardSoftware EngineerDetermine Whether a Word Exists in a Character Grid
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.
Coding & AlgorithmsTechnical Screen
Uber