Blind 75 Tracker
75 problems across 18 topics. Mark what you solved, flag what needs another pass, and keep an honest revision queue instead of a checklist that lies to you.
Showing 75 of 75 problems. Focus a row and press s for solved, r for revise, x to clear.
- Contains Duplicate Easy video
- Valid Anagram Easy video
- Two Sum Easy video
- Group Anagrams Medium video
- Top K Frequent Elements Medium video
- Product of Array Except Self Medium video
- Encode and Decode Strings Medium video
- Longest Consecutive Sequence Medium video
- Valid Palindrome Easy video
- 3Sum Medium video
- Container With Most Water Medium video
- Valid Parentheses Easy video
- Reverse Linked List Easy video
- Merge Two Sorted Lists Easy video
- Reorder List Medium video
- Remove Nth Node From End of List Medium video
- Linked List Cycle Easy video
- Merge K Sorted Lists Hard video
- Invert Binary Tree Easy video
- Maximum Depth of Binary Tree Easy video
- Same Tree Easy video
- Subtree of Another Tree Easy video
- Lowest Common Ancestor of a Binary Search Tree Medium video
- Binary Tree Level Order Traversal Medium video
- Validate Binary Search Tree Medium video
- Kth Smallest Element In a Bst Medium video
- Construct Binary Tree From Preorder And Inorder Traversal Medium video
- Binary Tree Maximum Path Sum Hard video
- Serialize And Deserialize Binary Tree Hard video
- Combination Sum Medium video
- Word Search Medium video
- Number of Islands Medium video
- Clone Graph Medium video
- Pacific Atlantic Water Flow Medium video
- Course Schedule Medium video
- Number of Connected Components In An Undirected Graph Medium video
- Graph Valid Tree Medium video
- Alien Dictionary Hard video
- Climbing Stairs Easy video
- House Robber Medium video
- House Robber II Medium video
- Longest Palindromic Substring Medium video
- Palindromic Substrings Medium video
- Decode Ways Medium video
- Coin Change Medium video
- Maximum Product Subarray Medium video
- Word Break Medium video
- Longest Increasing Subsequence Medium video
- Unique Paths Medium video
- Longest Common Subsequence Medium video
- Maximum Subarray Medium video
- Jump Game Medium video
- Insert Interval Medium video
- Merge Intervals Medium video
- Non Overlapping Intervals Medium video
- Meeting Rooms Easy video
- Meeting Rooms II Medium video
- Rotate Image Medium video
- Spiral Matrix Medium video
- Set Matrix Zeroes Medium video
- Number of 1 Bits Easy video
- Counting Bits Easy video
- Reverse Bits Easy video
- Missing Number Easy video
- Sum of Two Integers Medium video
Move or clear your progress
Progress lives in this browser only. Export it to a file to carry it to another device or browser, then paste it back in there. Importing merges per problem using timestamps, so the newer record wins and nothing gets silently overwritten.
How to work through Blind 75
Blind 75 is a revision list, not a course. It works because the 75 problems map onto about fifteen patterns that interviewers reuse endlessly, so finishing it leaves you able to recognise a problem shape in the first minute rather than the fifteenth.
Go topic by topic in the order below rather than jumping around. Arrays and hashing first, then two pointers and sliding window, because almost everything later assumes you are comfortable scanning an array with two indices. Graphs and dynamic programming last, when you have the stamina for them.
Give each problem twenty five minutes. If you have not found the approach by then, read the editorial, understand it properly, then mark the problem for revision and move on. The mistake is sitting on one hard problem for two hours and calling it a productive evening.
Revise on a three day gap. A problem you understood on Monday and cannot reproduce on Thursday was never learned, and finding that out in week three is much better than finding it out in an interview.
Who this suits. Anyone with four to eight weeks before interviews who already knows the basics of arrays, recursion and hash maps.
Who it does not. Complete beginners. Blind 75 assumes you can already write a loop and a recursive function without looking things up.
Questions people ask
How long does Blind 75 take?
At two to three problems a day, 75 problems takes roughly 4 weeks including revision. Doubling the daily pace does not halve the time, because retention is the bottleneck, not throughput.
Where is my progress stored?
In your browser, using local storage. It is never uploaded, which means it works signed out and offline, and also means it does not follow you to another device unless you export and import the file.
What does the revision flag do?
Marking a problem for revision puts it in the revision queue, ordered oldest first. Use it for anything you solved by reading the editorial. Those are the problems that fail you in an interview.
Is Blind 75 enough on its own?
Complete beginners. Blind 75 assumes you can already write a loop and a recursive function without looking things up.
Are the problem links official?
Yes. Every problem links to its LeetCode page, and where a free video walkthrough exists it is linked too. This tracker adds progress tracking on top, it does not host the problems.
Credits and sources
Sheet credit: Originally compiled by Yangshun Tay. The original sheet is here. The problem listing used by this tracker comes from neetcode-gh/leetcode (MIT licensed). Problems are hosted by LeetCode, and every row links there. Listing last rebuilt 2026-09-08.