DSA Tracker

DSA Tracker

Unofficial tracker

Blind 75 tracker

Blind 75 is a well-known list of 75 LeetCode problems for coding interviews, chosen to cover the patterns that come up again and again. All 75 are on DSA Tracker: solve each one in the built-in editor, step through it visually, and track it with the rest of your prep. The list belongs to its author; see the original on NeetCode.

Start with problem 1, freeReorder for your target role
75of 75 on DSA Tracker
19Easy
49Medium
7Hard
18patterns

All 75 problems, by pattern

In the list's own order. Each title opens our write-up; Solve opens it in the editor.

Arrays & Hashing (8)

  1. 1Contains DuplicateArraysEasySolve
  2. 2Valid AnagramStringsEasySolve
  3. 3Two SumArraysEasySolve
  4. 4Group AnagramsStringsMediumSolve
  5. 5Top K Frequent ElementsHeapMediumSolve
  6. 6Product of Array Except SelfArraysMediumSolve
  7. 7Encode and Decode StringsStringsMediumSolve
  8. 8Longest Consecutive SequenceArraysMediumSolve

Two Pointers (3)

  1. 9Valid PalindromeStringsEasySolve
  2. 103SumArraysMediumSolve
  3. 11Container With Most WaterArraysMediumSolve

Sliding Window (4)

  1. 12Best Time to Buy and Sell StockArraysEasySolve
  2. 13Longest Substring Without Repeating CharactersStringsMediumSolve
  3. 14Longest Repeating Character ReplacementStringsMediumSolve
  4. 15Minimum Window SubstringStringsHardSolve

Stack (1)

  1. 16Valid ParenthesesStackEasySolve

Binary Search (2)

  1. 17Find Minimum in Rotated Sorted ArrayArraysMediumSolve
  2. 18Search in Rotated Sorted ArrayArraysMediumSolve

Linked List (6)

  1. 19Reverse Linked ListLinked ListEasySolve
  2. 20Merge Two Sorted ListsLinked ListEasySolve
  3. 21Reorder ListLinked ListMediumSolve
  4. 22Remove Nth Node From End of ListLinked ListMediumSolve
  5. 23Linked List CycleLinked ListEasySolve
  6. 24Merge k Sorted ListsLinked ListHardSolve

Trees (11)

  1. 25Invert Binary TreeBinary TreesEasySolve
  2. 26Maximum Depth of Binary TreeBinary TreesEasySolve
  3. 27Same TreeBinary TreesEasySolve
  4. 28Subtree of Another TreeBinary TreesEasySolve
  5. 29Lowest Common Ancestor of a Binary Search TreeBSTMediumSolve
  6. 30Binary Tree Level Order TraversalBinary TreesMediumSolve
  7. 31Validate Binary Search TreeBSTMediumSolve
  8. 32Kth Smallest Element in a BSTBSTMediumSolve
  9. 33Construct Binary Tree from Preorder and Inorder TraversalBinary TreesMediumSolve
  10. 34Binary Tree Maximum Path SumBinary TreesHardSolve
  11. 35Serialize and Deserialize Binary TreeBinary TreesHardSolve

Tries (3)

  1. 36Implement Trie (Prefix Tree)TrieMediumSolve
  2. 37Design Add and Search Words Data StructureTrieMediumSolve
  3. 38Word Search IIBacktrackingHardSolve

Heap / Priority Queue (1)

  1. 39Find Median from Data StreamHeapHardSolve

Backtracking (2)

  1. 40Combination SumBacktrackingMediumSolve
  2. 41Word SearchMatrixMediumSolve

Graphs (6)

  1. 42Number of IslandsGraphMediumSolve
  2. 43Clone GraphGraphMediumSolve
  3. 44Pacific Atlantic Water FlowGraphMediumSolve
  4. 45Course ScheduleGraphMediumSolve
  5. 46Number of Connected Components in an Undirected GraphGraphMediumSolve
  6. 47Graph Valid TreeGraphMediumSolve

Advanced Graphs (1)

  1. 48Alien DictionaryGraphHardSolve

1-D Dynamic Programming (10)

  1. 49Climbing StairsDynamic ProgrammingEasySolve
  2. 50House RobberDynamic ProgrammingMediumSolve
  3. 51House Robber IIDynamic ProgrammingMediumSolve
  4. 52Longest Palindromic SubstringStringsMediumSolve
  5. 53Palindromic SubstringsStringsMediumSolve
  6. 54Decode WaysDynamic ProgrammingMediumSolve
  7. 55Coin ChangeDynamic ProgrammingMediumSolve
  8. 56Maximum Product SubarrayArraysMediumSolve
  9. 57Word BreakDynamic ProgrammingMediumSolve
  10. 58Longest Increasing SubsequenceDynamic ProgrammingMediumSolve

2-D Dynamic Programming (2)

  1. 59Unique PathsDynamic ProgrammingMediumSolve
  2. 60Longest Common SubsequenceDynamic ProgrammingMediumSolve

Greedy (2)

  1. 61Maximum SubarrayArraysMediumSolve
  2. 62Jump GameDynamic ProgrammingMediumSolve

Intervals (5)

  1. 63Insert IntervalIntervalsMediumSolve
  2. 64Merge IntervalsIntervalsMediumSolve
  3. 65Non-overlapping IntervalsIntervalsMediumSolve
  4. 66Meeting RoomsIntervalsEasySolve
  5. 67Meeting Rooms IIIntervalsMediumSolve

Math & Geometry (3)

  1. 68Rotate ImageMatrixMediumSolve
  2. 69Spiral MatrixMatrixMediumSolve
  3. 70Set Matrix ZeroesMatrixMediumSolve

Bit Manipulation (5)

  1. 71Number of 1 BitsBit ManipulationEasySolve
  2. 72Counting BitsBit ManipulationEasySolve
  3. 73Reverse BitsBit ManipulationEasySolve
  4. 74Missing NumberBit ManipulationEasySolve
  5. 75Sum of Two IntegersBit ManipulationMediumSolve

Questions, answered.

Is this the official Blind 75?

No. Blind 75 belongs to its author, and NeetCode publishes it with video explanations at neetcode.io. This is an unofficial tracker: it maps the list onto DSA Tracker's own problems so you can solve and track them in one place. DSA Tracker is not affiliated with NeetCode or LeetCode.

How many Blind 75 problems are on DSA Tracker?

75 of the 75, every one of them.

How do I track my progress?

Open any problem in the built-in editor and mark it solved, with or without an account. Progress is shared across the whole site, so a problem solved here also counts on your roadmap, your daily plan and every other list it belongs to.

Why do a few problems open on GeeksforGeeks?

A few problems on the list are LeetCode Premium. For those, DSA Tracker links a free version of the same problem on another judge.

Keep going

NeetCode 150 trackerLeetCode patternsConsensus 75Prep by role