Blind 75
The famous Blind 75 — the 75 most-referenced LeetCode problems across 10 core patterns, originally curated on the Blind forum. Every problem already has a full write-up in the bank.
Array
Binary
- Sum of Two IntegersMedium
- Number of 1 BitsEasy
- Counting BitsEasy
- Missing NumberEasy
- Reverse BitsEasy
Dynamic Programming
- Climbing StairsEasy
- Coin ChangeMedium
- Longest Increasing SubsequenceMedium
- Longest Common SubsequenceMedium
- Word BreakMedium
- Combination SumMedium
- House RobberMedium
- House Robber IIMedium
- Decode WaysMedium
- Unique PathsMedium
- Jump GameMedium
Graph
- Clone GraphMedium
- Course ScheduleMedium
- Pacific Atlantic Water FlowMedium
- Number of IslandsMedium
- Longest Consecutive SequenceMedium
- Alien DictionaryHard
- Graph Valid TreeMedium
- Number of Connected Components In An Undirected GraphMedium
Interval
- Insert IntervalMedium
- Merge IntervalsMedium
- Non Overlapping IntervalsMedium
- Meeting RoomsEasy
- Meeting Rooms IIMedium
Linked List
Matrix
- Set Matrix ZeroesMedium
- Spiral MatrixMedium
- Rotate ImageMedium
- Word SearchMedium
String
Tree
- Maximum Depth of Binary TreeEasy
- Same TreeEasy
- Invert Binary TreeEasy
- Binary Tree Maximum Path SumHard
- Binary Tree Level Order TraversalMedium
- Serialize And Deserialize Binary TreeHard
- Subtree of Another TreeEasy
- Construct Binary Tree From Preorder And Inorder TraversalMedium
- Validate Binary Search TreeMedium
- Kth Smallest Element In a BstMedium
- Lowest Common Ancestor of a Binary Search TreeMedium
- Implement Trie Prefix TreeMedium
- Design Add And Search Words Data StructureMedium
- Word Search IIHard