Google Master DSA Sheet
This compilation contains exclusive, previously asked data structure and algorithm questions from real Google interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.
top-specificgoogle-prep
02217
Medium
Breadth-First SearchDepth-First SearchTree
+1Medium
Binary TreeBreadth-First SearchTree
+1Medium
ArrayBinary SearchMatrix
+2Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Hard
ArrayHash TableHeap (Priority Queue)
+2Medium
Binary Search TreeBinary TreeDivide and Conquer
+3Hard
Breadth-First SearchDepth-First SearchTree
+1Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Hard
Binary TreeBreadth-First SearchDepth-First Search
+4Hard
ArrayBinary SearchBit Manipulation
+6Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
ArrayGreedySorting
+1Hard
ArrayDynamic ProgrammingSegment Tree
+1Hard
Breadth-First SearchDepth-First SearchDynamic Programming
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
Breadth-First SearchDepth-First SearchHash Table
+2Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
ArrayBinary TreeDivide and Conquer
+3Medium
Dynamic ProgrammingGraph TheoryShortest Path
+1Medium
Dynamic ProgrammingSliding WindowString
+1Medium
ArrayBit ManipulationPrefix Sum
+3Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
Binary Search TreeBinary TreeDepth-First Search
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Cheapest Flights Within K Stops3 Months
Medium
Breadth-First SearchDepth-First SearchDynamic Programming
+4Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Hard
Binary TreeBreadth-First SearchDepth-First Search
+4Hard
Graph TheoryHeap (Priority Queue)Shortest Path
+1Medium
Breadth-First SearchDepth-First SearchGraph Theory
+1Hard
ArrayBreadth-First SearchGraph Theory
+4Medium
Bit ManipulationHash TablePrefix Sum
+2Medium
Binary TreeDepth-First SearchString
+2Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Hard
ArrayBinary SearchPrefix Sum
+3Medium
Dynamic ProgrammingGraph TheoryHeap (Priority Queue)
+3Medium
ArrayDynamic Programming
Medium
Bit ManipulationSimulationString
+1Hard
ArrayDynamic ProgrammingHeap (Priority Queue)
+1Medium
ArrayBinary SearchMonotonic Stack
+3Medium
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
ArrayBinary Search TreeBinary Tree
+4Medium
ArrayBinary TreeDivide and Conquer
+3Medium
Divide and ConquerHash TableSliding Window
+2Medium
Binary TreeBreadth-First SearchDepth-First Search
+4Medium
ArrayHeap (Priority Queue)Monotonic Queue
+4Hard
Graph TheoryHeap (Priority Queue)Minimum Spanning Tree
+2Medium
Binary SearchBit ManipulationDynamic Programming
+2Medium
ArrayHash TableString
+1Hard
ArrayDynamic ProgrammingGreedy
+3Medium
Binary TreeBreadth-First SearchDepth-First Search
+3Medium
ArrayBinary SearchDynamic Programming
+3Hard
Graph TheoryMinimum Spanning TreeSorting
+3Medium
ArrayBreadth-First SearchDepth-First Search
+3Hard
Breadth-First SearchDepth-First SearchGraph Theory
+2Medium
Bit ManipulationHash FunctionHash Table
+3Medium
BacktrackingBit ManipulationBitmask
+3Medium
ArrayMathNumber Theory
+1Medium
Depth-First SearchDoubly-Linked ListLinked List
+1Medium
ArrayBinary TreeDivide and Conquer
+3Medium
ArrayBacktrackingBit Manipulation
+2Hard
Depth-First SearchDynamic ProgrammingHeap (Priority Queue)
+3Medium
Binary SearchBreadth-First SearchDepth-First Search
+3Hard
ArrayBreadth-First SearchHeap (Priority Queue)
+2Hard
ArrayDivide and ConquerDynamic Programming
+2Hard
ArrayDepth-First SearchDynamic Programming
+2Medium
ArrayBinary SearchPrefix Sum
+3Medium
ArrayDynamic ProgrammingMonotonic Queue
+4