B75

Under 1 month

Blind 75

The classic 75-question list for focused, high-yield interview revision.

75Problems
10Groups
19Easy
49Medium
7Hard
Start →
0%0 / 75
01

Array

10
  1. 1Two SumHashing & CountingEasy
  2. 2Best Time to Buy and Sell StockArray ManipulationEasy
  3. 3Contains DuplicateHashing & CountingEasy
  4. 4Product of Array Except SelfArray ManipulationMedium
  5. 5Maximum SubarrayKadane's Running BestMedium
  6. 6Maximum Product SubarrayKadane's Running BestMedium
  7. 7Find Minimum in Rotated Sorted ArrayBinary SearchMedium
  8. 8Search in Rotated Sorted ArrayBinary SearchMedium
  9. 93SumTwo PointersMedium
  10. 10Container With Most WaterTwo PointersMedium
02

Binary

5
  1. 11Sum of Two IntegersBit ManipulationMedium
  2. 12Number of 1 BitsBit ManipulationEasy
  3. 13Counting BitsBit ManipulationEasy
  4. 14Missing NumberBit ManipulationEasy
  5. 15Reverse BitsBit ManipulationEasy
03

Dynamic Programming

11
  1. 16Climbing Stairs1-D Dynamic ProgrammingEasy
  2. 17Coin ChangeKnapsack DPMedium
  3. 18Longest Increasing SubsequenceLongest Increasing SubsequenceMedium
  4. 19Longest Common SubsequenceString DPMedium
  5. 20Word BreakString DPMedium
  6. 21Combination Sum IVKnapsack DPMedium
  7. 22House Robber1-D Dynamic ProgrammingMedium
  8. 23House Robber II1-D Dynamic ProgrammingMedium
  9. 24Decode WaysString DPMedium
  10. 25Unique PathsGrid DPMedium
  11. 26Jump GameGreedyMedium
04

Graph

8
  1. 27Clone GraphGraph DFSMedium
  2. 28Course ScheduleTopological SortMedium
  3. 29Pacific Atlantic Water FlowGraph DFSMedium
  4. 30Number of IslandsGraph DFSMedium
  5. 31Longest Consecutive SequenceHashing & CountingMedium
  6. 32Alien DictionaryTopological SortHard
  7. 33Graph Valid TreeUnion-FindMedium
  8. 34Number of Connected Components in an Undirected GraphUnion-FindMedium
05

Interval

5
  1. 35Insert IntervalIntervals & Line SweepMedium
  2. 36Merge IntervalsIntervals & Line SweepMedium
  3. 37Non-overlapping IntervalsIntervals & Line SweepMedium
  4. 38Meeting RoomsIntervals & Line SweepEasy
  5. 39Meeting Rooms IIIntervals & Line SweepMedium
06

Linked List

6
  1. 40Reverse Linked ListLinked List TechniquesEasy
  2. 41Linked List CycleFast & Slow PointersEasy
  3. 42Merge Two Sorted ListsRecursion & Divide and ConquerEasy
  4. 43Merge k Sorted ListsK-Way MergeHard
  5. 44Remove Nth Node From End of ListLinked List TechniquesMedium
  6. 45Reorder ListLinked List TechniquesMedium
07

Matrix

4
  1. 46Set Matrix ZeroesMatrix TraversalMedium
  2. 47Spiral MatrixMatrix TraversalMedium
  3. 48Rotate ImageMatrix TraversalMedium
  4. 49Word SearchBacktrackingMedium
08

String

10
  1. 50Longest Substring Without Repeating CharactersSliding WindowMedium
  2. 51Longest Repeating Character ReplacementSliding WindowMedium
  3. 52Minimum Window SubstringSliding WindowHard
  4. 53Valid AnagramHashing & CountingEasy
  5. 54Group AnagramsHashing & CountingMedium
  6. 55Valid ParenthesesStackEasy
  7. 56Valid PalindromeString ManipulationEasy
  8. 57Longest Palindromic SubstringString DPMedium
  9. 58Palindromic SubstringsString DPMedium
  10. 59Encode and Decode StringsString ManipulationMedium
09

Tree

14
  1. 60Maximum Depth of Binary TreeTree DFSEasy
  2. 61Same TreeTree DFSEasy
  3. 62Invert Binary TreeTree DFSEasy
  4. 63Binary Tree Maximum Path SumTree DFSHard
  5. 64Binary Tree Level Order TraversalTree BFS (Level Order)Medium
  6. 65Serialize and Deserialize Binary TreeTree DFSHard
  7. 66Subtree of Another TreeTree DFSEasy
  8. 67Construct Binary Tree from Preorder and Inorder TraversalTree DFSMedium
  9. 68Validate Binary Search TreeBinary Search Tree & In-orderMedium
  10. 69Kth Smallest Element in a BSTBinary Search Tree & In-orderMedium
  11. 70Lowest Common Ancestor of a Binary Search TreeBinary Search Tree & In-orderMedium
  12. 71Implement Trie (Prefix Tree)TrieMedium
  13. 72Design Add and Search Words Data StructureTrieMedium
  14. 73Word Search IITrieHard
10

Heap

2
  1. 74Top K Frequent ElementsHeap & Top-KMedium
  2. 75Find Median from Data StreamTwo HeapsHard

How to use this track

Blind 75 is the classic short list for revising coding interviews in a few weeks. It covers the core patterns once, so it is the right place to start if you are short on time or getting back into interviews after a break.

Aim for two or three problems a day. Read the problem, give yourself 20 minutes to reach any working idea, then open the brute force, better and optimal approaches and compare them with your own. Tick a problem as solved only when you can code the optimal approach from scratch.

Add anything that felt shaky to your revision list and revisit it after three days and again after a week. When the list feels comfortable, move on to Pattern Wise 150 for depth.