Measured, not curated
The Consensus 75
Apna College, Love Babbar 450 and Striver A2Z were put together by different people, at different times, with no coordination. These 75 problems appear in all three. Nobody picked them; they are what survives when you keep only the problems every sheet already agreed on.
Where the agreement concentrates
The three sheets converge hardest on the fundamentals. That distribution is itself the signal: it is what three independent curators thought you cannot skip.
All 75 problems
Easiest first, so there is an obvious place to begin. Every one of these is in Apna College, Love Babbar 450 and Striver A2Z.
- 1Best Time to Buy and Sell StockArraysEasy
- 2Majority ElementArraysEasy
- 3Merge Sorted ArrayArraysEasy
- 4Two SumArraysEasy
- 5Binary SearchBinary SearchEasy
- 6Sqrt(x)Binary SearchEasy
- 7Balanced Binary TreeBinary TreesEasy
- 8Binary Tree Inorder TraversalBinary TreesEasy
- 9Binary Tree Postorder TraversalBinary TreesEasy
- 10Binary Tree Preorder TraversalBinary TreesEasy
- 11Diameter of Binary TreeBinary TreesEasy
- 12Invert Binary TreeBinary TreesEasy
- 13Maximum Depth of Binary TreeBinary TreesEasy
- 14Same TreeBinary TreesEasy
- 15Symmetric TreeBinary TreesEasy
- 16Missing NumberBit ManipulationEasy
- 17Single NumberBit ManipulationEasy
- 18Climbing StairsDynamic ProgrammingEasy
- 19Flood FillGraphEasy
- 20Fractional KnapsackGreedyEasy
- 21Linked List CycleLinked ListEasy
- 22Merge Two Sorted ListsLinked ListEasy
- 23Middle of the Linked ListLinked ListEasy
- 24Palindrome Linked ListLinked ListEasy
- 25Reverse Linked ListLinked ListEasy
- 26Implement Queue using StacksQueueEasy
- 27Valid ParenthesesStackEasy
- 283SumArraysMedium
- 29Container With Most WaterArraysMedium
- 30Longest Consecutive SequenceArraysMedium
- 31Maximum SubarrayArraysMedium
- 32Product of Array Except SelfArraysMedium
- 33Sort ColorsArraysMedium
- 34Sort Colors (Arrays)ArraysMedium
- 35Subarray Sum Equals KArraysMedium
- 36Lowest Common Ancestor of a Binary Search TreeBSTMedium
- 37Validate Binary Search TreeBSTMedium
- 38Combination SumBacktrackingMedium
- 39Letter Combinations of a Phone NumberBacktrackingMedium
- 40PermutationsBacktrackingMedium
- 41Rat in a MazeBacktrackingMedium
- 42SubsetsBacktrackingMedium
- 43Binary Tree Level Order TraversalBinary TreesMedium
- 44Construct Binary Tree from Preorder and Inorder TraversalBinary TreesMedium
- 45Lowest Common Ancestor of a Binary TreeBinary TreesMedium
- 460 - 1 Knapsack ProblemDynamic ProgrammingMedium
- 47Coin ChangeDynamic ProgrammingMedium
- 48House RobberDynamic ProgrammingMedium
- 49Jump GameDynamic ProgrammingMedium
- 50Longest Common SubsequenceDynamic ProgrammingMedium
- 51Longest Increasing SubsequenceDynamic ProgrammingMedium
- 52Unique PathsDynamic ProgrammingMedium
- 53Number of IslandsGraphMedium
- 54Rotting OrangesGraphMedium
- 55Activity SelectionGreedyMedium
- 56Job Sequencing ProblemGreedyMedium
- 57Top K Frequent ElementsHeapMedium
- 58Merge IntervalsIntervalsMedium
- 59Add Two NumbersLinked ListMedium
- 60Remove Nth Node From End of ListLinked ListMedium
- 61Sieve of EratosthenesMathMedium
- 62Merge SortSortingMedium
- 63Quick SortSortingMedium
- 64Generate ParenthesesStackMedium
- 65Min StackStackMedium
- 66Stock Span ProblemStackMedium
- 67Group AnagramsStringsMedium
- 68Longest Palindromic SubstringStringsMedium
- 69Longest Substring Without Repeating CharactersStringsMedium
- 70Reverse Words in a StringStringsMedium
- 71Implement Trie (Prefix Tree)TrieMedium
- 72Two Sum II - Input Array Is SortedTwo PointersMedium
- 73Trapping Rain WaterArraysHard
- 74N-QueensBacktrackingHard
- 75Largest Rectangle in HistogramStackHard
Questions, answered.
What is the Consensus 75?
The 75 problems that appear in all three of the DSA sheets this tracker covers: Apna College, Love Babbar 450 and Striver A2Z. The three lists were built independently, so a problem landing in all of them means three separate curators reached the same conclusion about it.
How is this different from Blind 75?
Blind 75 is one engineer's curated list, and a good one. This is not a curated list at all; it is the intersection of three existing sheets, computed from the dataset. Nobody chose these 75; they are what is left when you keep only the problems everyone already agreed on.
Is 75 enough to prepare for interviews?
It is enough to cover the patterns that repeat. These 75 skew toward the fundamentals (27 Easy, 45 Medium, 3 Hard), which is what a first pass should look like. Once they are comfortable, the remaining problems in the full 370 are where you specialise for your target role.
Do I have to solve them in this order?
No. They are listed easiest-first so there is an obvious place to start, but the tracker can reorder the whole set for the role you are actually interviewing for, which changes what deserves your attention first.
Then specialise
These 75 are the shared base. What comes after depends on the job: a frontend interview and an SDET interview diverge sharply once the fundamentals are done.