Grind75, a better Blind75 you can customize

#bookmark #grind75 #leetcode

April 16, 2025

Prerequisites

To understand this note, these notes may help:

Leetcode discussion on Blind75 LeetCode questions
- Memorising Leetcode by using Anki as a Scheduler

www.techinterviewhandbook.org. "Grind 75 - A better Blind 75 you can customize, by the author of Blind 75". Archived. Retrieved April 16, 2025.

All Leetcode problems are broken down into patterns. And these 75 questions will show you all the patterns. Learn the patterns, and you will be able to conquer the fire nation.

Week 1

id	name	difficulty	estimated time	topic
1	Two Sum	Easy	15 mins	Array
2	Valid Parentheses	Easy	20 mins	Stack
3	Merge Two Sorted Lists	Easy	20 mins	Linked List
4	Best Time to Buy and Sell Stock	Easy	20 mins	Array
5	Valid Palindrome	Easy	15 mins	String
6	Invert Binary Tree	Easy	15 mins	Binary Tree
7	Valid Anagram	Easy	15 mins	String
8	Binary Search	Easy	15 mins	Binary Search
9	Flood Fill	Easy	20 mins	Graph
10	Lowest Common Ancestor of a Binary Search Tree	Easy	20 mins	Binary Search Tree
11	Balanced Binary Tree	Easy	15 mins	Binary Tree
12	Linked List Cycle	Easy	20 mins	Linked List
13	Implement Queue using Stacks	Easy	20 mins	Stack

Week 2

id	name	difficulty	estimated time	topic
1	First Bad Version	Easy	20 mins	Binary Search
2	Ransom Note	Easy	15 mins	Hash Table
3	Climbing Stairs	Easy	20 mins	Dynamic Programming
4	Longest Palindrome	Easy	20 mins	String
5	Reverse Linked List	Easy	20 mins	Linked List
6	Majority Element	Easy	20 mins	Array
7	Add Binary	Easy	15 mins	Binary
8	Diameter of Binary Tree	Easy	30 mins	Binary Tree
9	Middle of the Linked List	Easy	20 mins	Linked List
10	Maximum Depth of Binary Tree	Easy	15 mins	Binary Tree
11	Contains Duplicate	Easy	15 mins	Array
12	Maximum Subarray	Medium	20 mins	Dynamic Programming

Week 3

id	name	difficulty	estimated time	topic
1	Insert Interval	Medium	25 mins	Array
2	01 Matrix	Medium	30 mins	Graph
3	K Closest Points to Origin	Medium	30 mins	Heap
4	Longest Substring Without Repeating Characters	Medium	30 mins	String
5	3Sum	Medium	30 mins	Array
6	Binary Tree Level Order Traversal	Medium	20 mins	Binary Tree
7	Clone Graph	Medium	25 mins	Graph
8	Evaluate Reverse Polish Notation	Medium	30 mins	Stack

Week 4

id	name	difficulty	estimated time	topic
1	Course Schedule	Medium	30 mins	Graph
2	Implement Trie (Prefix Tree)	Medium	35 mins	Trie
3	Coin Change	Medium	25 mins	Dynamic Programming
4	Product of Array Except Self	Medium	30 mins	Array
5	Min Stack	Medium	20 mins	Stack
6	Validate Binary Search Tree	Medium	20 mins	Binary Search Tree
7	Number of Islands	Medium	25 mins	Graph
8	Rotting Oranges	Medium	30 mins	Graph

Week 5

id	name	difficulty	estimated time	topic
1	Search in Rotated Sorted Array	Medium	30 mins	Binary Search
2	Combination Sum	Medium	30 mins	Array
3	Permutations	Medium	30 mins	Recursion
4	Merge Intervals	Medium	30 mins	Array
5	Lowest Common Ancestor of a Binary Tree	Medium	25 mins	Binary Tree
6	Time Based Key-Value Store	Medium	35 mins	Binary Search
7	Accounts Merge	Medium	30 mins	Graph
8	Sort Colors	Medium	25 mins	Array

Week 6

id	name	difficulty	estimated time	topic
1	Word Break	Medium	30 mins	Trie
2	Partition Equal Subset Sum	Medium	30 mins	Dynamic Programming
3	String to Integer (atoi)	Medium	25 mins	String
4	Spiral Matrix	Medium	25 mins	Matrix
5	Subsets	Medium	30 mins	Recursion
6	Binary Tree Right Side View	Medium	20 mins	Binary Tree
7	Longest Palindromic Substring	Medium	25 mins	String
8	Unique Paths	Medium	20 mins	Dynamic Programming
9	Construct Binary Tree from Preorder and Inorder Traversal	Medium	25 mins	Binary Tree

Week 7

id	name	difficulty	estimated time	topic
1	Container With Most Water	Medium	35 mins	Array
2	Letter Combinations of a Phone Number	Medium	30 mins	Recursion
3	Word Search	Medium	30 mins	Graph
4	Find All Anagrams in a String	Medium	30 mins	String
5	Minimum Height Trees	Medium	30 mins	Graph
6	Task Scheduler	Medium	35 mins	Heap
7	LRU Cache	Medium	30 mins	Linked List

Week 8

id	name	difficulty	estimated time	topic
1	Kth Smallest Element in a BST	Medium	25 mins	Binary Search Tree
2	Minimum Window Substring	Hard	30 mins	String
3	Serialize and Deserialize Binary Tree	Hard	40 mins	Binary Tree
4	Trapping Rain Water	Hard	35 mins	Stack
5	Find Median from Data Stream	Hard	30 mins	Heap
6	Word Ladder	Hard	45 mins	Graph
7	Basic Calculator	Hard	40 mins	Stack
8	Maximum Profit in Job Scheduling	Hard	45 mins	Binary Search
9	Merge k Sorted Lists	Hard	30 mins	Heap
10	Largest Rectangle in Histogram	Hard	35 mins	Stack