Uber Coding Interview Questions
Uber problems
Uber favors real-world, map- and route-flavored problems: shortest paths, matrix traversal, and interval logic. Expect a systems design round about dispatch or matching. Practice BFS/DFS and graph problems heavily before the onsite.
Uber Interview Loop Structure
- • Practice shortest-path and graph algorithms thoroughly (BFS, Dijkstra, A*)
- • Design with horizontal sharding and eventual consistency in mind
- • Validate all edge cases before declaring your code complete
4-Week Preparation Strategy for Uber
Action PlanTo maximize your offer probability at Uber, avoid random LeetCode grinding. Follow this structured 4-week roadmap tailored to Uber's specific interview loop and evaluation bar:
Week 1: High-Frequency Patterns
Focus on foundational patterns tested heavily at Uber: Two Pointers, Sliding Window, and Hash Map frequency tracking. Solve 10–12 Easy/Medium questions and establish code muscle memory without syntax lookups.
Week 2: Advanced Graph & Tree Drills
Master BFS, DFS, Topological Sorting, and Priority Queues (Min/Max Heaps). Practice articulating state transitions and recursion stack depth trade-offs under real-time interviewer pressure.
Week 3: Timed Mock Coding & Complexity
Simulate real 45-minute technical screens. Spend 5 minutes clarifying requirements, 10 minutes discussing brute-force vs optimal trade-offs, 20 minutes coding cleanly, and 10 minutes dry-running boundary test cases.
Week 4: System Architecture & Behavioral STAR
Draft 5 distinct STAR method stories (Situation, Task, Action, Result) mapped to Uber's core principles. Review distributed systems fundamentals: caching tiers, partitioning, rate limiting, and database consistency models.
💡 What Uber Interviewers Evaluate:
Interviewers score candidates across 4 independent pillars: Algorithmic Optimality (arriving at optimal Big-O), Code Craftsmanship (modular functions, clean naming, zero syntax debt), Communication & Thinking Out Loud (proactive collaboration, asking clarifying questions), and Edge Case Rigor (null checks, integer overflows, duplicate inputs).
High Frequency at Uber
Most AskedThese problems appear most frequently in Uber interviews based on reported data.
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Minimum Window Substring
#String
#Hash Map
#Sliding Window | Hard | Solution | ||
| Find All Anagrams in a String
#String
#Hash Map
#Sliding Window | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Group Anagrams
#String
#Hash Map
#Sorting | Medium | Solution | ||
| LRU Cache
#Hash Table
#Linked List
#Design | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Edit Distance
#String
#DP | Hard | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Gas Station
#Array
#Greedy | Medium | Solution | ||
| Meeting Rooms II
#Array
#Greedy
#Sorting | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Course Schedule II
#Graph
#DFS
#BFS | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| Capacity to Ship Packages Within D Days
#Array
#Binary Search | Medium | Solution |
| Problem | Difficulty | Solution | Link | |
|---|---|---|---|---|
| K Closest Points to Origin
#Array
#Math
#Divide and Conquer | Medium | Solution | ||
| Find K Pairs with Smallest Sums
#Array
#Heap | Medium | Solution |