Uber Master DSA Sheet
This compilation contains exclusive, previously asked data structure and algorithm questions from real Uber interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.
top-specificuber-prep
0381
Hard
Bit ManipulationBitmaskDepth-First Search
+3Hard
Breadth-First SearchDepth-First SearchDynamic Programming
+2Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Dynamic ProgrammingGraph TheoryShortest Path
+1Medium
ArrayDynamic ProgrammingGreedy
+1Medium
ArrayBit ManipulationPrefix Sum
+3Medium
Breadth-First SearchCountingDepth-First Search
+3Cheapest Flights Within K Stops3 Months
Medium
Breadth-First SearchDepth-First SearchDynamic Programming
+4Medium
Bit ManipulationDynamic ProgrammingGreedy
+1Hard
ArrayDynamic ProgrammingHeap (Priority Queue)
+1Medium
ArrayBreadth-First SearchHash Table
+3Medium
ArrayHeap (Priority Queue)Monotonic Queue
+4Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Hard
Graph TheoryMinimum Spanning TreeSorting
+3Hard
ArrayBreadth-First SearchHeap (Priority Queue)
+5