24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

Grind 75
by the author of Blind 75
Change question preferences

Grind 75 questions
Customize LeetCode study plans according to your needs. You are recommended to
work on the questions in order. Find out why.
Questions Summary
TIME NEEDED 64 hours
Fits into your schedule.

DIFFICULTY Easy: 24 Medium: 42 Hard: 9

Array: 11 Binary: 1 Binary Search: 5 Binary Search Tree: 3 Binary Tree: 9
TOPICS Dynamic Programming: 5 Graph: 10 Hash Table: 1 Heap: 4 Linked List: 5
Matrix: 1 Recursion: 3 Stack: 7 String: 8 Trie: 2
Need study resources? Check out Tech Interview Handbook's algorithm study cheatsheets.

COMPLETED 17 / 75

Based on Preferences Order by Difficulty Group by Weeks Hide topics

Week 1 4 / 13

1 Two Sum
Easy · 15 mins · Array

2 Valid Parentheses
Easy · 20 mins · Stack

3 Merge Two Sorted Lists

Easy · 20 mins · Linked List

https://www.techinterviewhandbook.org/grind75/ 1/8
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

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 3 / 12

1 First Bad Version

Easy · 20 mins · Binary Search

2 Ransom Note
Easy · 15 mins · Hash Table
Climbing Stairs
https://www.techinterviewhandbook.org/grind75/ 2/8
 3
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

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 3 / 8

1 Insert Interval
Medium · 25 mins · Array

2 01 Matrix
Medium · 30 mins · Graph

https://www.techinterviewhandbook.org/grind75/ 3/8
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

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 1 / 8

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
Number of Islands
https://www.techinterviewhandbook.org/grind75/ 4/8
 7
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

Medium · 25 mins · Graph

8 Rotting Oranges
Medium · 30 mins · Graph

Week 5 3 / 8

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 1 / 9

1 Word Break
Medium · 30 mins · Trie

2 Partition Equal Subset Sum

https://www.techinterviewhandbook.org/grind75/ 5/8
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

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 1 / 7

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

https://www.techinterviewhandbook.org/grind75/ 6/8
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

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 1 / 10

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
Largest Rectangle in Histogram
https://www.techinterviewhandbook.org/grind75/ 7/8
 10
24/12/2024, 00:10 Grind 75 - A better Blind 75 you can customize, by the author of Blind 75

Hard · 35 mins · Stack

Have feedback or questions?

If you have any feedback or questions, feel free to email us!
We will get back to you as soon as possible.
[email protected]

© 2024 Tech Interview Handbook. All rights reserved.

https://www.techinterviewhandbook.org/grind75/ 8/8