Uber Interview Process 2026 — Rounds, Tips & Questions
Everything about the Uber interview process: rounds, what each round tests, difficulty level, and 18 real questions asked by engineers who cleared the loop.
Interview Rounds at Uber
- Phone screen
- Technical x2
- System Design
- Hiring Manager
Uber frequently asks about geo-spatial systems, matching algorithms, and surge pricing. Show you understand distributed system trade-offs.
Real Questions Asked at Uber
Your PySpark job has data skew on a join key (user_id) where 1% of users account for 60% of the data. How do you handle it?
Design Uber's driver-rider matching system. How do you match the nearest available driver to a rider within 200ms at global scale? Cover: geospatial indexing (H3/S2), the dispatch algorithm, how you handle supply-demand imbalances, and what happens when a matched driver rejects the trip.
Your pipeline SLA requires data to be available in the warehouse by 6 AM. Yesterday it missed at 7:30 AM. Walk me through your incident response.
Design Uber's dynamic pricing (surge) system. When supply is low and demand is high in a geofenced zone, prices increase automatically. Explain the data pipeline, the pricing model, how you prevent oscillations (price going up → drivers rush in → price drops → drivers leave), and regulatory constraints.
Design Uber Eats' order batching system. A single delivery partner picks up orders from multiple nearby restaurants and delivers to multiple customers in one trip. How do you optimise the route and assignment?
Design Uber's payment reconciliation system. Uber collects payments in 70+ countries with different currencies, payment methods, and regulations. How do you reconcile driver payouts against rider charges and detect discrepancies?
Uber uses H3 hexagonal geospatial indexing. Explain why hexagons are better than squares or lat/lng grids for proximity searches. How do you find all drivers within 2km of a rider using H3 resolution levels?
Design a ride-sharing system like Uber. Focus on matching riders to drivers in real-time.
Given a city map as a weighted graph, find the shortest travel time from a driver's current location to all potential passenger pickup points simultaneously. How does Dijkstra's multi-source variant solve this?
Design the rider-driver matching system for a ride-hailing app. How would you balance minimizing rider wait time against fairness in driver earnings distribution?
Practice these questions with AI feedback
Get instant grading on your answers, identify your weak areas, and generate a personalised 14-day study plan — all free.
Build my study plan →