Uber
Challenges: 5Medium: 4Hard: 1
This Uber coding interview set pulls together 5 challenges, with a mix of 4 medium, 1 hard. The problems lean on dijkstra, graphs, shortest-path, hash-map, simulation, so you can drill the patterns that come up most and walk into the interview ready.
Topics this company tests
- dijkstra
- graphs
- shortest-path
- hash-map
- simulation
- greedy
- heaps
- counting
- matrix
- arrays
- sliding-window
Uber coding challenges
Cross Region Failover Path
Difficulty: HardTopics: dijkstra, graphs, shortest-pathMessage Deduplication Window
Difficulty: MediumTopics: hash-map, simulationQueue Load Balancer
Difficulty: MediumTopics: greedy, heaps, simulationRide Demand Heatmap
Difficulty: MediumTopics: counting, hash-map, matrixSliding Log Rate Limiter
Difficulty: MediumTopics: arrays, simulation, sliding-window
Ready to practice for real?
Work through coding challenges like the ones Uber asks, run your code, and check your solution against real test cases.
Practice coding challenges, start free