Uber interview questions

Showing 121–150 of 217 results

• Find all dictionary words in a gridMedium

  This problem tests your ability to navigate a 2D grid using backtracking and optimize dictionary lookups using a Trie data structure.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find cheapest flight with at most K stopsHard

  This question evaluates graph algorithm proficiency and problem-modeling skills, specifically working with directed weighted graphs to optimize path cost under a constraint on intermediate stops.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find earliest common meeting slotMedium

  This problem tests interval management and the ability to find a common free window across multiple disjoint sets of busy times while respecting daily working constraints.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find earliest time all riders become connectedHard

  Assesses understanding of graph connectivity, temporal event processing, and dynamic graph data-structures for determining when a set of nodes becomes a single connected component.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find leftmost point of maximum brightnessMedium

  This question evaluates understanding of interval overlap counting, efficient use of ordered data structures for range events, tie-breaking logic, and robustness to numeric edge cases such as large coordinates and floating-point radii.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum activations to absorb all ballsMedium

  This question evaluates the ability to model Euclidean-distance relations as a static connectivity graph and reason about the minimum number of activations needed to absorb all nodes, testing computational geometry and graph algorithms competency.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find minimum reversals to orient edges away from rootMedium

  This question evaluates understanding of directed graphs and rooted trees, the ability to reason about edge orientations and minimal reversals, and competency in traversal techniques and complexity analysis.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find next and closest palindromesMedium

  This question evaluates string-based numeric manipulation and palindrome construction, including edge-case handling (all 9s, single-digit inputs, length changes), candidate generation and magnitude comparison of large numbers as strings, and carry propagation for fixed-length decimal palindromes.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find robots in a grid whose four-direction distances to blockers match a queryMedium

  Given a grid of robots, blockers and empty cells plus a query of four distances, return every robot whose distances to the nearest blocker or grid edge going up, down, left and right match the query exactly. Tests precise distance definitions, boundary handling and scaling past a per-robot scan.

  UberMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Find robots matching obstacle-distance signatureHard

  This problem tests spatial reasoning, multi-source Breadth-First Search (BFS) for distance mapping, and pattern matching within 2D grids.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find shortest jumps in circular arrayMedium

  This question evaluates graph-traversal and modular arithmetic skills by requiring modeling a circular array as a state graph and determining reachability and minimum-distance jumps under wrap-around constraints.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find smallest start index avoiding left exitEasy

  This question evaluates a candidate's ability to analyze reachability and cycle behavior in array-based functional graphs, testing competency in array manipulation, traversal, loop detection, and runtime optimization within the Coding & Algorithms domain.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the Best Currency Conversion RateMedium

  Find the largest conversion factor obtainable between two currencies in a directed graph where rates multiply along each path. Handle parallel rates, unreachable targets, identical currencies, cycles, and floating-point tolerance under a finite-optimum guarantee.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find the Cheapest Valid Round TripMedium

  Find the cheapest round-trip flight pair satisfying a minimum stay duration constraint in linear time with deterministic tie-breaking.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the First Unique LogMedium

  This problem tests your ability to efficiently process a stream or list of logs to identify the first log entry that appears exactly once, emphasizing the use of hash maps and ordered tracking.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the K Closest Points to a Query LocationMedium

  This problem tests the ability to efficiently find the k nearest neighbors using a priority queue (max-heap) and custom sorting logic for tie-breaking.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Find the Next Larger PalindromeMedium

  This question evaluates proficiency in numeric and string manipulation, algorithmic thinking, and edge-case reasoning related to palindromic number generation.

  UberData ScientistCoding & AlgorithmsOnsite
• Fix unclear delivery addressesMedium

  Diagnose and fix unclear delivery addresses in a marketplace delivery product. Covers root-cause analysis, risky-address detection, address validation, courier recovery, metrics, guardrails, and phased rollout.

  UberTechnical Program ManagerProduct / Decision MakingTechnical Screen
• Formulate OR model to reduce driver backtrackingMedium

  This question evaluates skills in defining a quantitative driver-backtracking metric from GPS and assignment logs, detecting and validating backtracking segments, and formulating constrained optimization models for dispatch and repositioning, drawing on statistics, operations research, and stochastic optimization.

  UberData ScientistStatistics & MathOnsite
• Formulate hypotheses and compute AB test significanceHard

  This question evaluates a data scientist's competency in experimental design and statistical inference for A/B testing, covering hypothesis formulation, difference-in-proportions testing and confidence intervals, guardrail analysis, multiple-testing correction, interim alpha-spending approaches, and variance-reduction techniques such as CUPED.

  UberData ScientistStatistics & MathTechnical Screen
• Group AnagramsMedium

  This problem tests your ability to identify and implement an efficient grouping mechanism using hash maps to categorize strings by a common canonical form.

  UberSoftware EngineerCoding & AlgorithmsOnsite
• Group strings that are anagramsMedium

  This problem tests your ability to efficiently group strings by their character composition using hash maps or sorting techniques.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Handle invalid Lisp expression parsingMedium

  This question evaluates the ability to parse and evaluate nested Lisp-like expressions, manage variable bindings and scope resolution, and detect malformed input and syntax errors.

  UberSoftware EngineerCoding & AlgorithmsOnline Assessment
• How to experiment on ETA reductionEasy

  This problem tests the ability to design an A/B test for product improvements and address potential confounding factors like selection bias and spillover effects.

  UberData ScientistAnalytics & ExperimentationTechnical Screen
• How would you build UberEats ranking?Medium

  This question assesses the ability to design an end-to-end ranking system for a food delivery platform, focusing on objective formulation, feature selection, and the trade-offs between relevance and business constraints.

  UberData ScientistMachine LearningTechnical Screen
• How would you design an ETA prediction system?Easy

  This problem tests the ability to design an end-to-end machine learning system for predicting ride arrival times, focusing on feature selection, model architecture, and evaluation strategies.

  UberData ScientistMachine LearningTechnical Screen
• Implement 1D convex minimization in PythonMedium

  An Uber Machine Learning Engineer technical-screen question on derivative-free 1D convex optimization: minimize a black-box convex function on a closed interval using only function evaluations. It tests method selection (golden-section vs ternary search), stopping criteria and tolerances, function-evaluation and time/space complexity analysis, and robust handling of flat regions, boundary optima, noisy evaluations, and numerical precision.

  UberMachine Learning EngineerMachine LearningTechnical Screen
• Implement 2D word search variants and analyze complexityMedium

  This question evaluates proficiency in grid-based string search, traversal techniques (fixed-direction scanning versus flexible-path exploration), algorithm design including backtracking/DFS, and the ability to analyze time and space complexity while accounting for redundancy and edge cases.

  UberSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement CLIP Contrastive LossMedium

  This question evaluates understanding and implementation of contrastive representation learning concepts—specifically similarity matrices, symmetric image-text contrastive loss, normalization, temperature scaling, and label construction—testing competency in building losses for embedding alignment in the Machine Learning domain.

  UberMachine Learning EngineerMachine LearningTechnical Screen
• Implement Cache Eviction And Seat AssignmentMedium

  This problem tests your ability to combine a Least Recently Used (LRU) cache mechanism with a greedy strategy for geometric optimization in seat assignments.

  UberSoftware EngineerCoding & AlgorithmsOnsite