Blind 75 came from a Meta engineer's post on Blind and is the ancestor of every sheet since. It is deliberately small, which is both its strength and its limit: 75 problems is achievable in two weeks, and 75 problems is not enough to cover greedy, advanced graphs, or the harder DP shapes.
Use it if you are two weeks out, or you want a confidence pass over material you already know. Treat it as the minimum bar, not the target -- clearing Blind 75 does not mean you are ready for a Google onsite.
Note that it predates several problems now considered standard, so a few categories look thin by modern standards. That is a property of the list, not a transcription error.
Track it here
Your progress is shared with every other list on this site -- tick a problem off here and it is ticked off on its pattern page and in every other sheet that includes it. That is the point of tracking them in one place.
Blind 75
by yangshun / the original Blind post · original sheet
The original list, compiled by a Meta engineer. Smaller and older than NeetCode 150 but still the fastest route to broad pattern coverage — treat it as the minimum bar rather than the target.
15
- 1Two Sumeasy
- 217Contains Duplicateeasy
- 347Top K Frequent Elementsmedium
- 238Product of Array Except Selfmedium
- 128Longest Consecutive Sequencemedium
- 153Summedium
- 11Container With Most Watermedium
- 121Best Time to Buy and Sell Stockeasy
- 39Combination Summedium
- 57Insert Intervalmedium
- 56Merge Intervalsmedium
- 435Non-overlapping Intervalsmedium
- 252Meeting Roomspremiumeasy
- 253Meeting Rooms IIpremiummedium
- 268Missing Numbereasy
9
- 242Valid Anagrameasy
- 49Group Anagramsmedium
- 271Encode and Decode Stringspremiummedium
- 125Valid Palindromeeasy
- 3Longest Substring Without Repeating Charactersmedium
- 424Longest Repeating Character Replacementmedium
- 76Minimum Window Substringhard
- 5Longest Palindromic Substringmedium
- 647Palindromic Substringsmedium
1
- 20Valid Parentheseseasy
3
- 48Rotate Imagemedium
- 54Spiral Matrixmedium
- 73Set Matrix Zeroesmedium
2
- 153Find Minimum in Rotated Sorted Arraymedium
- 33Search in Rotated Sorted Arraymedium
6
- 206Reverse Linked Listeasy
- 21Merge Two Sorted Listseasy
- 141Linked List Cycleeasy
- 143Reorder Listmedium
- 19Remove Nth Node From End of Listmedium
- 23Merge k Sorted Listshard
8
- 226Invert Binary Treemedium
- 104Maximum Depth of Binary Treeeasy
- 100Same Treeeasy
- 572Subtree of Another Treeeasy
- 102Binary Tree Level Order Traversalmedium
- 105Construct Binary Tree from Preorder and Inorder Traversalmedium
- 124Binary Tree Maximum Path Sumhard
- 297Serialize and Deserialize Binary Treehard
3
- 235Lowest Common Ancestor of a Binary Search Treemedium
- 98Validate Binary Search Treemedium
- 230Kth Smallest Element in a BSTmedium
3
- 208Implement Trie (Prefix Tree)medium
- 211Design Add and Search Words Data Structuremedium
- 212Word Search IIhard
1
- 295Find Median from Data Streamhard
8
- 79Word Searchmedium
- 200Number of Islandsmedium
- 133Clone Graphmedium
- 417Pacific Atlantic Water Flowmedium
- 207Course Schedulemedium
- 323Number of Connected Components in an Undirected Graphpremiummedium
- 261Graph Valid Treepremiummedium
- 269Alien Dictionarypremiumhard
12
- 70Climbing Stairseasy
- 198House Robbermedium
- 213House Robber IImedium
- 91Decode Waysmedium
- 322Coin Changemedium
- 152Maximum Product Subarraymedium
- 139Word Breakmedium
- 300Longest Increasing Subsequencemedium
- 62Unique Pathsmedium
- 55Jump Gamemedium
- 377Combination Sum IVmedium
- 53Maximum Subarraymedium
4
- 191Number of 1 Bitseasy
- 338Counting Bitseasy
- 190Reverse Bitseasy
- 371Sum of Two Integersmedium
Self-check
Who is Blind 75 best suited to?
It is small enough for two weeks but too small to cover greedy, advanced graphs or harder DP.
Show answer
C — Someone two weeks out or wanting a confidence pass — It is small enough for two weeks but too small to cover greedy, advanced graphs or harder DP.
Does clearing Blind 75 mean you are ready for a Google onsite?
The list predates several now-standard problems, so some categories look thin.
Show answer
D — No, treat it as the minimum bar, not the target — The list predates several now-standard problems, so some categories look thin.