The Sheets, Mapped

There are half a dozen well-known DSA sheets and they mostly contain the same problems. Nobody publishes how much the same, which leaves readers doing avoidable work: finish one sheet, start the next, and discover forty problems in that you have already done most of it.

Every sheet on this site lives in one database, so that question has an answer.

375 problems listed across 3 sheets

224 distinct problems once duplicates are removed

40% of the combined list is duplication

50 problems appear in 3 or more sheets

Read the last figure first. Those 50 problems are what the sheet authors independently agree on, which makes them the highest-value problems on this site — and the ones to do before anything else, whichever sheet you eventually commit to.

How much any two sheets share

Sheet A	Sheet B	Shared	Share of the smaller sheet
NeetCode 150	LeetCode Top Interview 150	77	51%
NeetCode 150	Blind 75	74	99%
Blind 75	LeetCode Top Interview 150	50	67%

The consensus problems

50 problems

12 easy33 medium5 hard

Every problem below appears in at least 3 of the sheets. Finish these and you have covered the core of all of them simultaneously.

AllEasyMediumHard

Unsolved onlyExportImportReset

• ○1Two Sumeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemetamicrosoftapplebloomberg
• ○20Valid Parentheseseasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemetamicrosoftbloomberg
• ○121Best Time to Buy and Sell Stockeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetamicrosoftbloomberg
• ○21Merge Two Sorted Listseasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmicrosoftapplebloomberg
• ○141Linked List Cycleeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmicrosoftbloomberg
• ○242Valid Anagrameasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetabloomberg
• ○70Climbing Stairseasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○100Same Treeeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○104Maximum Depth of Binary Treeeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○125Valid Palindromeeasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○190Reverse Bitseasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○191Number of 1 Bitseasyin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○3Longest Substring Without Repeating Charactersmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemetamicrosoftbloomberg
• ○153Summediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetamicrosoftapplebloomberg
• ○53Maximum Subarraymediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmicrosoftbloombergapple
• ○56Merge Intervalsmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googlemetaamazonuberbloomberg
• ○200Number of Islandsmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemetamicrosoftbytedance
• ○11Container With Most Watermediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetabloomberg
• ○33Search in Rotated Sorted Arraymediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetamicrosoftbloomberg
• ○49Group Anagramsmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetauberbloomberg
• ○102Binary Tree Level Order Traversalmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetamicrosoftbytedance
• ○139Word Breakmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googleamazonmetabytedance
• ○207Course Schedulemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googleamazonmetabytedance
• ○238Product of Array Except Selfmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazonmetamicrosoftapple
• ○300Longest Increasing Subsequencemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googlemicrosoftbytedanceuber
• ○322Coin Changemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemicrosoftbytedance
• ○133Clone Graphmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150metagoogleamazon
• ○208Implement Trie (Prefix Tree)mediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googleamazonbloomberg
• ○5Longest Palindromic Substringmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○19Remove Nth Node From End of Listmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○39Combination Summediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○48Rotate Imagemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○54Spiral Matrixmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○55Jump Gamemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○57Insert Intervalmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○73Set Matrix Zeroesmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○79Word Searchmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○98Validate Binary Search Treemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○105Construct Binary Tree from Preorder and Inorder Traversalmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○128Longest Consecutive Sequencemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○153Find Minimum in Rotated Sorted Arraymediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○198House Robbermediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○211Design Add and Search Words Data Structuremediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○226Invert Binary Treemediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○230Kth Smallest Element in a BSTmediumin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○76Minimum Window Substringhardin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150metaamazongoogleuber
• ○295Find Median from Data Streamhardin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150amazongooglemetabloomberg
• ○212Word Search IIhardin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150googleamazonbytedance
• ○23Merge k Sorted Listshardin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150
• ○124Binary Tree Maximum Path Sumhardin 3 sheetsNeetCode 150Blind 75LeetCode Top Interview 150

Reading those numbers

The duplication figure is the interesting one. The sheets are not competing curricula — they are the same curriculum with different amounts of padding around it. Which means:

• Finishing two sheets is not twice the work of one. Once you have done the first, the second is mostly a review pass with a handful of genuinely new problems.
• The consensus problems are the signal. When five authors working independently all include a problem, that is about as strong a signal as this domain produces. Those problems come first, always.
• A problem in exactly one sheet is a judgement call, not a requirement. Some are excellent and underrated. Some are that author’s personal favourite. Do them after the consensus set, not before.

The efficient order

1. The consensus problems below — every sheet agrees on these.
2. The rest of one sheet, chosen by your situation (see How to Use This Course).
3. Company-flavoured gaps, if you know where you are interviewing.
4. Another sheet only if you have time left over, which you probably will not.

Why the course is not organised as a sheet

A sheet tells you what to solve. It cannot tell you how to recognise the pattern in a problem you have not seen, and recognition is the entire skill an interview tests. That is why this course is organised by pattern, with the sheets attached to it as practice rather than the reverse.

Concretely: after LC 3, LC 209, LC 424 and LC 76, a sheet has taught you four solutions. The Sliding Window page tries to teach you the cue that fires on the fifth problem too — that “contiguous” plus “longest or shortest satisfying a monotonic condition” means a window, and that a negative number in the array means it does not.

Both matter. Do the sheets. Read the patterns first.

Where each sheet’s sections land in this course

Sheet section	Phase here
Arrays & Hashing · Array / String · Hashmap	03 Core Data Structures · 05 Array and String Patterns
Two Pointers · Sliding Window	05 Array and String Patterns
Stack · Monotonic Stack	03 Core Data Structures · 05 Array and String Patterns
Binary Search	04 Sorting and Searching · 06 Search and Selection
Linked List	03 Core Data Structures · 08 Linked List Patterns
Trees · Binary Tree BFS · Binary Search Tree	03 Core Data Structures · 09 Tree Patterns
Tries	03 Core Data Structures · 05 Trie Patterns
Heap / Priority Queue	03 Core Data Structures · 06 Search and Selection
Backtracking	11 Recursion and Backtracking
Graphs · Graph BFS	03 Graph Representations · 10 Graph Patterns
Advanced Graphs	16 Advanced Graph Algorithms
1-D and 2-D Dynamic Programming	12 Dynamic Programming
Greedy · Intervals	07 Intervals and Greedy
Math & Geometry · Bit Manipulation	13 Bit Manipulation and Math
Divide & Conquer	11 Recursion and Backtracking
Matrix	05 Matrix and Grid Manipulation

Striver’s sheets are indexed by step rather than by problem, and several of their problems live on GeeksforGeeks rather than LeetCode. Those two are therefore mapped step-to-phase rather than problem-to-problem, and their tracker pages say so rather than pretending otherwise.