Uber coding interview prep
Graphs, geo-flavoured problems, and a lot of intervals.
What the loop actually looks like
Uber's problems often echo the domain: routing and graphs, scheduling and intervals, and streaming/top-k questions. Difficulty sits in the medium-to-hard band, and design rounds arrive early in the ladder.
What they reward
- Graph traversal and shortest-path thinking
- Interval scheduling and merging
- Heaps for streaming and top-k
- System design earlier than you'd expect
Patterns to drill first
Problems worth your time
In priority order. Open one to read the approach, or generate an interactive lesson and watch it run.
Number of IslandsEach unvisited land cell launches a flood fill that sinks its whole island.
Medium
Meeting Rooms IIThe peak number of simultaneous meetings is the number of rooms needed.Medium
Merge IntervalsSort by start, then merge any interval that overlaps the last one kept.Medium
Course ScheduleYou can finish all courses iff the prerequisite graph has no cycle.Medium
Clone GraphMap original nodes to their clones as you traverse.Medium
Top K Frequent ElementsCount, then select the k largest — a heap or bucket sort beats a full sort.Medium
Find Median from Data StreamBalance a max-heap of the low half against a min-heap of the high half.Hard
Tips specific to this loop
- — Drill interval problems until sorting-then-sweeping is reflexive.
- — Be comfortable modelling a real-world scenario as a graph on the spot.
- — Start design prep earlier than you would for other companies at the same level.
Drill these with interactive lessons
Generate a step-by-step lesson for any problem above — trace every variable and watch the pattern move until it clicks.
Start a free lessonPrepping for other companies
Our own editorial read on this loop, based on publicly reported experiences — not leaked or current question banks.