Uber - 1 Month Prep Roadmap

For candidates with existing DSA foundation who need focused Uber-specific prep. ~3-4 hours/day | 6 days/week

Week 1: DSA Core (Most Asked Topics)

Day	Task	Problems
1	Graph BFS/DFS fundamentals	Number of Islands, Rotting Oranges
2	Graph BFS advanced	Bus Routes (asked 12x), Cheapest Flights Within K Stops
3	Topological Sort	Course Schedule II (asked 5x), Alien Dictionary (asked 4x)
4	Union Find	Number of Islands II (asked 3x), Making a Large Island
5	Intervals	Merge Intervals (asked 4x), My Calendar I (asked 4x), Interval List Intersections
6	Graph DFS + Euler	Reconstruct Itinerary (asked 4x), Evaluate Division

Course: Graph Course | Greedy → Intervals

Day	Task	Problems
1	DP - Grid	Minimum Path Sum, Dungeon Game, Cherry Pickup
2	DP - Strings + Sequences	Decode Ways, Word Break, Longest Increasing Subsequence
3	Sliding Window / Mono Queue	Longest Continuous Subarray (Abs Diff ≤ Limit) (asked 6x), Sliding Window Maximum, Longest Repeating Char Replacement
4	Heap / Priority Queue	Find Median from Data Stream (asked 3x), Task Scheduler (asked 3x), Merge K Sorted Lists
5	HashMap / Design	LRU Cache (asked 4x), Insert Delete GetRandom O(1) (asked 3x), Group Anagrams
6	Trees + Trie	Word Search II (asked 3x), Kth Smallest in BST, Implement Trie

Course: DP Course | Tree Course | Mono Stack → Sliding Window

Day	Task	Details
1	LLD: Parking Lot (asked 5x)	Multi-floor, Strategy + Factory patterns. Write runnable Java/Python.
2	LLD: In-Memory File System (asked 4x)	Composite pattern. Create/Delete/Move. Working code.
3	LLD: In-Memory Twitter (asked 3x)	Observer pattern, fan-out on write, getNewsFeed with heap.
4	LLD: Circuit Breaker (asked 3x)	State pattern, concurrency, OPEN/CLOSED/HALF_OPEN. Thread-safety.
5	HLD: Stock Notification System (asked 6x)	Kafka, streaming, pub-sub, time-series DB, sharding.
6	HLD: Driver Heatmap (asked 4x) + Top-K Trending (asked 4x)	GeoHash, real-time aggregation, Redis sorted sets, count-min sketch.

Course: LLD Course | System Design

Day	Task	Details
1	HLD: E-commerce Backend (asked 3x) + Notification System (asked 3x)	Kafka ingestion, fan-out, message queue.
2	LLD: Pub-Sub System (asked 3x) + Concurrency review	Multi-threaded, Observer pattern. Locks, semaphores.
3	Behavioral: Prepare 5 STAR stories	Ownership, conflict, impact, collaboration, mentorship.
4	Mock: Full DSA mock (2 problems, 45 min)	Write runnable code. Think out loud.
5	Mock: Full LLD mock (1 problem, 60 min)	Design patterns + working code + concurrency.
6	Mock: Full HLD mock (1 problem, 60 min)	Requirements → API → Data model → Architecture → Deep dive.

Category	Count
DSA problems solved	~30
LLD problems practiced	5
HLD problems practiced	5
Behavioral stories prepared	5

Runnable code required — Uber won't accept pseudocode. Your DSA and LLD code must compile and run.
Bus Routes is the single most asked problem (12x). Know BFS on graphs cold.
Concurrency is tested in LLD — thread-safety, locks, producer-consumer.
HLD bar raiser — the system design round is often the bar raiser. Don't just draw boxes, deep-dive into trade-offs.
Think out loud — Uber interviewers are collaborative and give hints. Listen carefully.