Under 1 month
Blind 75
The classic 75-question list for focused, high-yield interview revision.
01Array
10
- 1Two SumHashing & CountingEasy
- 2Best Time to Buy and Sell StockArray ManipulationEasy
- 3Contains DuplicateHashing & CountingEasy
- 4Product of Array Except SelfArray ManipulationMedium
- 5Maximum SubarrayKadane's Running BestMedium
- 6Maximum Product SubarrayKadane's Running BestMedium
- 7Find Minimum in Rotated Sorted ArrayBinary SearchMedium
- 8Search in Rotated Sorted ArrayBinary SearchMedium
- 93SumTwo PointersMedium
- 10Container With Most WaterTwo PointersMedium
02Binary
5
03Dynamic Programming
11
- 16Climbing Stairs1-D Dynamic ProgrammingEasy
- 17Coin ChangeKnapsack DPMedium
- 18Longest Increasing SubsequenceLongest Increasing SubsequenceMedium
- 19Longest Common SubsequenceString DPMedium
- 20Word BreakString DPMedium
- 21Combination Sum IVKnapsack DPMedium
- 22House Robber1-D Dynamic ProgrammingMedium
- 23House Robber II1-D Dynamic ProgrammingMedium
- 24Decode WaysString DPMedium
- 25Unique PathsGrid DPMedium
- 26Jump GameGreedyMedium
04Graph
8
- 27Clone GraphGraph DFSMedium
- 28Course ScheduleTopological SortMedium
- 29Pacific Atlantic Water FlowGraph DFSMedium
- 30Number of IslandsGraph DFSMedium
- 31Longest Consecutive SequenceHashing & CountingMedium
- 32Alien DictionaryTopological SortHard
- 33Graph Valid TreeUnion-FindMedium
- 34Number of Connected Components in an Undirected GraphUnion-FindMedium
05Interval
5
06Linked List
6
07Matrix
4
08String
10
- 50Longest Substring Without Repeating CharactersSliding WindowMedium
- 51Longest Repeating Character ReplacementSliding WindowMedium
- 52Minimum Window SubstringSliding WindowHard
- 53Valid AnagramHashing & CountingEasy
- 54Group AnagramsHashing & CountingMedium
- 55Valid ParenthesesStackEasy
- 56Valid PalindromeString ManipulationEasy
- 57Longest Palindromic SubstringString DPMedium
- 58Palindromic SubstringsString DPMedium
- 59Encode and Decode StringsString ManipulationMedium
09Tree
14
- 60Maximum Depth of Binary TreeTree DFSEasy
- 61Same TreeTree DFSEasy
- 62Invert Binary TreeTree DFSEasy
- 63Binary Tree Maximum Path SumTree DFSHard
- 64Binary Tree Level Order TraversalTree BFS (Level Order)Medium
- 65Serialize and Deserialize Binary TreeTree DFSHard
- 66Subtree of Another TreeTree DFSEasy
- 67Construct Binary Tree from Preorder and Inorder TraversalTree DFSMedium
- 68Validate Binary Search TreeBinary Search Tree & In-orderMedium
- 69Kth Smallest Element in a BSTBinary Search Tree & In-orderMedium
- 70Lowest Common Ancestor of a Binary Search TreeBinary Search Tree & In-orderMedium
- 71Implement Trie (Prefix Tree)TrieMedium
- 72Design Add and Search Words Data StructureTrieMedium
- 73Word Search IITrieHard
No problems match these filters.
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.