Uber interview questions

Showing 181–210 of 217 results

• Object-Oriented Parking Lot Design with Check-In and Check-OutHard

  An object-oriented design interview question asking you to model a parking lot and implement working check-in and check-out methods. It tests class design and relationships, fast free-spot lookup across vehicle sizes, ticket handling, fees, edge cases, and thread safety.

  UberSoftware EngineerSoftware Engineering FundamentalsOnsite
• Parse and evaluate nested expressions with validationMedium

  This question evaluates a developer's ability to design and implement a robust parser and evaluator for a parenthesized expression language, testing parsing, lexical scoping and variable binding, operator semantics, error detection, and safe integer arithmetic.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Present a Marketplace ML Project Deep DiveMedium

  This question evaluates a candidate's competence in end-to-end ML system design, product-oriented machine learning, and cross-functional skills such as feature engineering, model deployment, online experimentation, monitoring, stakeholder communication, and measuring business impact.

  UberMachine Learning EngineerML System DesignTechnical Screen
• Print directory tree with indentationMedium

  This question evaluates proficiency with representing and traversing hierarchical directory trees and producing depth-based formatted output, testing concepts such as tree traversal, recursion or iterative depth tracking, and string formatting for indentation.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Prioritize rooms for allocationHard

  This question evaluates a candidate's ability to design a real-time room allocation and ranking service in the System Design domain, testing competencies in architectural design, ranking and scoring functions, data sourcing and freshness, fairness mechanisms, and online evaluation and experimentation.

  UberSoftware EngineerSystem DesignOnsite
• Produce a valid deployment orderMedium

  This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Quadtree for 2D Geospatial PointsMedium

  This problem tests the implementation of a spatial indexing structure by requiring the construction of a Point Quadtree that recursively divides 2D space into four quadrants.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Reconstruct the Alphabet Order of an Alien LanguageMedium

  This question tests the ability to model partial ordering constraints using a directed graph and perform a topological sort to deduce a valid sequence.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Replace Dashes With Nearest LettersMedium

  This problem tests your ability to perform a multi-source shortest path search on a grid to determine the influence of characters on empty spaces, using Manhattan distance and lexicographical tie-breaking.

  UberBackend EngineerCoding & AlgorithmsTechnical Screen
• Return a Package Build OrderMedium

  This question evaluates a candidate's skills in dependency resolution, graph traversal and cycle detection while reasoning about an externally discovered dependency subgraph and ordering constraints.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Return the Earliest ID Seen Exactly OnceMedium

  Maintain the earliest single-visit ID with counts and queue pruning, handling permanent duplicates, empty results, and strict versus amortized constant-time queries.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Robot Grid Route with Charging Cells: Fewest Charges, Then Battery, Then MovesMedium

  A grid pathfinding problem in which a robot travels from a start cell to a destination through open, blocked and charging cells, spending one battery unit per move and refilling at chargers. The best route is ranked by fewest charging stops, then smallest required battery capacity, then fewest moves.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Schedule Non-Overlapping Meetings EfficientlyHard

  This problem tests your ability to manage dynamic intervals and determine if a new meeting can be scheduled without overlapping existing appointments using efficient data structures.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Shortest Path in a Grid with Blocked CellsMedium

  This problem tests your ability to model a 2D grid as a graph and implement a Breadth-First Search (BFS) to find the shortest path between two points while respecting obstacles.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Should Uber double member discounts?Medium

  This problem tests your ability to design a controlled experiment for a two-sided marketplace and evaluate whether a discount-doubling strategy is statistically and economically viable.

  UberData ScientistStatistics & MathTechnical Screen
• Simulate a Rank-Based TournamentMedium

  This question tests the ability to implement a single-elimination tournament simulation using queue-based structures and demonstrates competency in designing a relational database schema for tournament record-keeping.

  UberFrontend EngineerCoding & AlgorithmsTechnical Screen
• Simulate fixed-shape tiling on a gridMedium

  This question evaluates a candidate's ability to implement grid-based simulation and pattern-matching algorithms, including handling fixed-shape placements, internal holes, bounds checking, collision detection, and explicit scanning/tie-breaking rules.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Simulate robot on grid with obstaclesMedium

  Simulate robot on grid with obstacles 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
• Smallest Palindromic Number Strictly Greater Than n, Up to 18 DigitsHard

  Given a positive integer of up to 18 digits as a string, return the smallest palindromic number strictly greater than it, or the input itself when no such palindrome stays within 18 digits. Tests digit-level reasoning and edge cases such as palindromic inputs, carries and changes in digit count.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve 12 coding interview problemsMedium

  This multi-problem set evaluates broad algorithmic problem-solving skills, including bitwise reasoning, sliding-window and frequency analysis, stack/monotonic patterns, graph/DP reasoning with constrained jumps, and tree-path parity techniques.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve BFS and grid tasksMedium

  This collection evaluates understanding of search techniques (binary search and BFS), graph and grid traversal, state-space shortest-path reasoning, randomized placement with adjacency counting, and attention to implementation quality and complexity trade-offs.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Solve Balanced Permutations and Tree ReversalsMedium

  This two-part prompt evaluates array and permutation reasoning for detecting contiguous value ranges and directed graph/tree reasoning for minimizing edge reversals when choosing a root, testing competencies in index and interval management, graph traversal and orientation, and algorithmic counting.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Knight and Reversal ProblemsHard

  This question evaluates graph modeling, state-space exploration, and shortest-path/reachability reasoning for nonstandard movement rules and constrained state transformations.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Prime Jumps and Pipeline ScalingMedium

  This question evaluates algorithmic problem-solving skills in constrained path optimization and resource-allocation throughput maximization, including concepts such as graph modelling with prime-step constraints, dynamic programming, number-theoretic reasoning, and combinatorial optimization.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Two OA Algorithm ProblemsHard

  This problem tests your ability to optimize resource allocation using a greedy approach with a priority queue and to determine graph reachability within a constrained network.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve Wonderful Strings and Grid QueriesHard

  This problem tests your ability to optimize string transformations using bitmask dynamic programming and to perform efficient range-based queries on a grid using a 2D data structure or sweep-line approach.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve jump maximization and palindromic path queriesHard

  This problem tests dynamic programming with array constraints and tree-based traversal combined with bitwise parity checks for palindromic properties.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve stock profit and vertical tree traversalMedium

  Assesses proficiency in array processing and binary tree traversal algorithms—specifically single-pass analysis of time-series data and coordinate-based vertical ordering of tree nodes; Category: Coding & Algorithms; Level of abstraction: implementation-level algorithmic coding.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Solve two interview coding problemsMedium

  These two problems evaluate algorithmic problem-solving skills: the first focuses on spatial reasoning and grid-based distance computation relative to obstacles, while the second targets tree traversal and character-frequency reasoning for ancestor-path palindrome checks.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Sort a Matrix into Snake Order Using Adjacent SwapsHard

  Construct any legal adjacent-swap sequence that sorts a numbered matrix into snake order, prove correctness, validate the output, and discuss reducing swap counts.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen