NeetCode Blind 75 Solutions: study plan and how long it takes
The NeetCode playlist is 75 videos and 16.5 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
75 videos · 16.5 hours · NeetCode
The Blind 75 is a well-known list of 75 LeetCode problems that cover the patterns most coding interviews test. NeetCode's playlist explains a solution to every one in Python, from two sum to word search II.
Each video is around 10 to 20 minutes, so the whole list is a realistic three-to-four-week plan alongside a job or college.
Who it's for: Software engineers and students preparing for coding interviews who want the most interview value per hour.
How long does it take?
The full playlist is 16.5 hours across 75 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 33 days | 22 days | 17 days |
| 1 h a day | 17 days | 11 days | 9 days |
| 2 h a day | 9 days | 6 days | 5 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 3 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–29 · 6h 23m
Day 1 · 59m
- 1Two Sum - Leetcode 1 - HashMap - Python8m
- 2Sliding Window: Best Time to Buy and Sell Stock - Leetcode 121 - Python9m
- 3Contains Duplicate - Leetcode 217 - Python7m
- 4Product of Array Except Self - Leetcode 238 - Python12m
- 5Maximum Subarray - Amazon Coding Interview Question - Leetcode 53 - Python8m
- 6Maximum Product Subarray - Dynamic Programming - Leetcode 15216m
Day 2 · 51m
- 7Find Minimum in Rotated Sorted Array - Binary Search - Leetcode 153 - Python13m
- 8Search in rotated sorted array - Leetcode 33 - Python13m
- 93Sum - Leetcode 15 - Python13m
- 10Container with Most Water - Leetcode 11 - Python13m
Day 3 · 48m
- 11Number of 1 Bits - Leetcode 191 - Python12m
- 12Counting Bits - Dynamic Programming - Leetcode 338 - Python13m
- 13Missing Number - Blind 75 - Leetcode 268 - Python12m
- 14Reverse Bits - Binary - Leetcode 190 - Python10m
Day 4 · 56m
- 15Climbing Stairs - Dynamic Programming - Leetcode 70 - Python18m
- 16Coin Change - Dynamic Programming Bottom Up - Leetcode 32219m
- 17Longest Increasing Subsequence - Dynamic Programming - Leetcode 30018m
Day 5 · 1h
- 18Longest Common Subsequence - Dynamic Programming - Leetcode 114318m
- 19Word Break - Dynamic Programming - Leetcode 139 - Python16m
- 20Combination Sum - Backtracking - Leetcode 39 - Python15m
- 21House Robber - Leetcode 198 - Python Dynamic Programming11m
Day 6 · 53m
- 22House Robber II - Dynamic Programming - Leetcode 21311m
- 23Decode Ways - Dynamic Programming - Leetcode 91 - Python15m
- 24Unique Paths - Dynamic Programming - Leetcode 6211m
- 25Jump Game - Greedy - Leetcode 5516m
Day 7 · 56m
- 26Clone Graph - Depth First Search - Leetcode 13312m
- 27Course Schedule - Graph Adjacency List - Leetcode 20716m
- 28Pacific Atlantic Water Flow - Leetcode 417 - Python16m
- 29NUMBER OF ISLANDS - Leetcode 200 - Python12m
Week 2Videos 30–59 · 6h 24m
Day 8 · 46m
- 30Leetcode 128 - LONGEST CONSECUTIVE SEQUENCE9m
- 31Alien Dictionary - Topological Sort - Leetcode 269 - Python22m
- 32Graph Valid Tree - Leetcode 261 - Python14m
Day 9 · 59m
- 33Number of Connected Components in an Undirected Graph - Union Find - Leetcode 323 - Python16m
- 34Insert Interval - Leetcode 57 - Python12m
- 35Merge Intervals - Sorting - Leetcode 5610m
- 36Non-Overlapping Intervals - Leetcode 435 - Python13m
- 37Meeting Rooms - Leetcode 252 - Python8m
Day 10 · 58m
- 38Meeting Rooms II - Leetcode 253 - Python12m
- 39Reverse Linked List - Iterative AND Recursive - Leetcode 206 - Python11m
- 40Linked List Cycle - Floyd's Tortoise and Hare - Leetcode 141 - Python11m
- 41Merge Two Sorted Lists - Leetcode 21 - Python6m
- 42Merge K Sorted Lists - Leetcode 23 - Python11m
- 43Remove Nth Node from End of List - Oracle Interview Question - Leetcode 197m
Day 11 · 49m
- 44Linkedin Interview Question - Reorder List - Leetcode 143 - Python14m
- 45Set Matrix Zeroes - In-place - Leetcode 7318m
- 46Spiral Matrix - Microsoft Interview Question - Leetcode 5417m
Day 12 · 54m
- 47Rotate Image - Matrix - Leetcode 4816m
- 48Word Search - Backtracking - Leetcode 79 - Python10m
- 49Longest Substring Without Repeating Characters - Leetcode 3 - Python7m
- 50Longest Repeating Character Replacement - Leetcode 424 - Python21m
Day 13 · 1h
- 51Minimum Window Substring - Airbnb Interview Question - Leetcode 7626m
- 52Group Anagrams - Categorize Strings by Count - Leetcode 498m
- 53Valid Parentheses - Stack - Leetcode 20 - Python11m
- 54Valid Palindrome - Leetcode 125 - Python15m
Day 14 · 59m
- 55Longest Palindromic Substring - Python - Leetcode 58m
- 56Palindromic Substrings - Leetcode 647 - Python15m
- 57Encode and Decode Strings - Leetcode 271 - Python12m
- 58Maximum Depth of Binary Tree - 3 Solutions - Leetcode 104 - Python17m
- 59Same Tree - Leetcode 100 - Python8m
Week 3Videos 60–75 · 3h 42m
Day 15 · 57m
- 60Invert Binary Tree - Depth First Search - Leetcode 2264m
- 61Binary Tree Maximum Path Sum - DFS - Leetcode 124 - Python15m
- 62Binary Tree Level Order Traversal - BFS - Leetcode 10210m
- 63Serialize and Deserialize Binary Tree - Preorder Traversal - Leetcode 297 - Python14m
- 64Subtree of Another Tree - Leetcode 572 - Python14m
Day 16 · 45m
- 65Construct Binary Tree from Inorder and Preorder Traversal - Leetcode 105 - Python17m
- 66Validate Binary Search Tree - Depth First Search - Leetcode 9810m
- 67Kth Smallest Element in a BST - Leetcode 230 - Python11m
- 68Lowest Common Ancestor of a Binary Search Tree - Leetcode 235 - Python7m
Day 17 · 1h
- 69Implement Trie (Prefix Tree) - Leetcode 20819m
- 70Design Add and Search Words Data Structure - Leetcode 211 - Python20m
- 71Word Search II - Backtracking Trie - Leetcode 212 - Python21m
Day 18 · 49m
- 72Top K Frequent Elements - Bucket Sort - Leetcode 347 - Python13m
- 73Find Median from Data Stream - Heap & Priority Queue - Leetcode 29524m
- 74Valid Anagram - Leetcode 242 - Python12m
Day 19 · 12m
- 75Sum of Two Integers - Leetcode 371 - Java12m
Tips for finishing
- Attempt each problem on LeetCode first and only watch the video after you've solved it or been stuck for 30 minutes.
- Use the planner with a short daily time (30 to 45 minutes of video) and spend the rest of your session coding.