Uber

Uber

Ride-hailing and delivery platform with massive real-time data challenges.

4 Rounds ~21 Days Hard
Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

Cloud Engineer • Coding • medium

Given a list of server objects with their current CPU load and memory usage, write a load balancer function that distributes incoming requests to the least loaded server.

#Data Structures #Load Balancing #Optimization
Practice
Cloud Engineer • Coding • hard

Implement a rate limiter using a token bucket algorithm to prevent API abuse from a single client ID.

#Concurrency #Rate Limiting #System Design Implementation
Practice
Data Engineer • Coding • hard

Given a continuous stream of trip distances, design a data structure and write the Python code to return the median trip distance at any given time efficiently.

#Heaps #Data Streams #Design
Practice
Data Engineer • Coding • medium

Given a list of driver online sessions as [start_time, end_time] pairs, write a Python function to merge all overlapping sessions and return the total time the driver was online and available for dispatch.

#Arrays #Sorting #Intervals
Practice
Data Scientist • Coding • medium

Given a list of driver locations (x,y coordinates) and a rider's location, write a Python function to find the k-nearest available drivers. Optimize for performance assuming millions of drivers.

#Heaps #Spatial Data Structures #Python
Practice
Data Scientist • Coding • medium

You are given a dataset of Uber rides. Write a Python script to simulate a simple Markov Chain to predict the probability of a driver ending up in City B given they started in City A.

#Probability #Markov Chains #Python #Data Manipulation
Practice
Machine Learning Engineer • Coding • medium

Implement an autocomplete system for the Uber app destination search. Given a prefix, return the top 5 most frequently searched locations.

#Trie #Hash Map #String Manipulation #Design
Practice
Machine Learning Engineer • Coding • medium

Given an array of ride requests with start and end times, find the minimum number of drivers required to fulfill all requests.

#Arrays #Sorting #Greedy #Heap
Practice
Machine Learning Engineer • Coding • hard

Given a city map represented as a weighted directed graph where nodes are intersections and edges are roads with travel times, write a function to find the top K shortest paths between a rider and a destination.

#Graphs #Dijkstra #A* Search #Priority Queue
Practice
Software Engineer • Coding • medium

You are given a list of overlapping ride requests, where each request has a start time and end time. Write a function to merge all overlapping ride times and return the consolidated active driving periods.

#Arrays #Sorting #Intervals
Practice
Software Engineer • Coding • medium

Given a grid representing a city map where 0 is a valid road, 1 is a traffic jam (impassable), and a start and end coordinate, find the shortest path for an Uber driver to reach the destination.

#BFS #Shortest Path #Graph Theory #Matrices
Practice
Software Engineer • Coding • medium

Implement a Rate Limiter. Given a user ID and a timestamp, return true if the request should be allowed, and false if it exceeds the limit of N requests per M seconds.

#Sliding Window #Queues #Concurrency #Hash Map
Practice
Software Engineer • Coding • hard

Given a list of bus routes where each route is a list of bus stops. Return the minimum number of buses you must take to travel from a source stop to a destination stop.

#BFS #Graphs #Hash Maps
Practice
Software Engineer • Coding • hard

Implement an autocomplete system for Uber's destination search. Given a list of historical destination strings and a search prefix, return the top 3 most frequently searched destinations matching the prefix.

#Trie #Heaps #String Manipulation #Design
Practice
Software Engineer • Coding • medium

Design and implement an LRU (Least Recently Used) Cache. It should support get and put operations in O(1) time complexity.

#Hash Map #Doubly Linked List #Data Structures
Practice
Software Engineer • Coding • medium

Given an array of driver locations represented by [x, y] coordinates and a rider's location, find the k closest drivers to the rider.

#Heaps #QuickSelect #Geometry #Sorting
Practice

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now