Amazon Master DSA Sheet
This compilation contains exclusive, previously asked data structure and algorithm questions from real Amazon interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.
top-specificamazon-prep
01938
Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Hard
ArrayHash TableHeap (Priority Queue)
+2Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Binary TreeBreadth-First SearchTree
+1Medium
ArrayBinary SearchMatrix
+2Hard
ArrayBinary SearchBit Manipulation
+6Hard
Binary TreeBreadth-First SearchDepth-First Search
+4Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
Breadth-First SearchDepth-First SearchEnumeration
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Hard
Breadth-First SearchDepth-First SearchDynamic Programming
+2Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Breadth-First SearchDepth-First SearchHash Table
+2Medium
ArraySliding Window
Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
ArrayBinary TreeDivide and Conquer
+3Medium
CountingDynamic ProgrammingHash Table
+2Medium
ArrayBit ManipulationPrefix Sum
+3Medium
Binary Search TreeBinary TreeDepth-First Search
+5Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Dynamic ProgrammingGraph TheoryShortest Path
+1Medium
Breadth-First SearchDepth-First SearchGraph Theory
+1Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
Binary Search TreeBinary TreeDepth-First Search
+2Medium
Bit ManipulationHash TablePrefix Sum
+2Cheapest Flights Within K Stops3 Months
Medium
Breadth-First SearchDepth-First SearchDynamic Programming
+4Medium
Binary TreeDepth-First SearchString
+2Hard
Binary TreeBreadth-First SearchDepth-First Search
+4Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Hard
ArrayDynamic ProgrammingHeap (Priority Queue)
+1Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Bit ManipulationSimulationString
+1Medium
Binary TreeBreadth-First SearchDepth-First Search
+4Easy
Binary TreeBreadth-First SearchDepth-First Search
+2Medium
ArrayBinary TreeDivide and Conquer
+3Medium
Divide and ConquerHash TableSliding Window
+2Medium
ArrayBinary Search TreeBinary Tree
+4Hard
Graph TheoryMinimum Spanning TreeSorting
+3Hard
ArrayBinary SearchMonotonic Stack
+2Medium
ArrayHeap (Priority Queue)Monotonic Queue
+4Hard
ArrayDynamic ProgrammingGreedy
+3Hard
Depth-First SearchDynamic ProgrammingHeap (Priority Queue)
+3Hard
Dynamic ProgrammingHash TableString
+1Medium
ArrayBinary Indexed TreeBinary Search
+3Medium
ArrayBinary SearchPrefix Sum
+3Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
ArrayDynamic ProgrammingMonotonic Queue
+4Medium
ArrayCombinatoricsDynamic Programming
+3Medium
ArrayBinary SearchSorting
+2Medium
ArrayMathNumber Theory
+1Medium
Depth-First SearchDoubly-Linked ListLinked List
+1Medium
ArrayBinary TreeDivide and Conquer
+3Medium
Hash TableSliding WindowString
+1