GRIND 75 by the author of Blind 75 Open menu 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
TOPICS
Array: 11Binary: 1Binary Search: 5Binary Search Tree: 3Binary Tree: 9Dynamic Programming: 5Graph: 10Hash Table: 1Heap: 4Linked List: 5Matrix: 1Recursion: 3Stack: 7String: 8Trie: 2
Need study resources? Check out Tech Interview Handbook’s algorithm study cheatsheets.
COMPLETED 0 / 75
You can now bookmark the page to save your preferences! We also recently changed the questions presentation settings. Refer to the changelog for more details.
Viewing ModeBased on PreferencesView All QuestionsAll RoundedOrder by DifficultyOrder by TopicsQuestions GroupingNo GroupingGroup by WeeksGroup by TopicsGroup by Difficulty
Show topics
Week 1
0 / 13
- Two Sum Easy·15 mins
- Valid Parentheses Easy·20 mins
- [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists Easy·20 mins
- Best Time to Buy and Sell Stock Easy·20 mins
- Valid PalindromeEasy·15 mins
- Invert Binary TreeEasy·15 mins
- Valid AnagramEasy·15 mins
Easy·15 mins
9
Easy·20 mins
10
Lowest Common Ancestor of a Binary Search Tree
Easy·20 mins
11
Easy·15 mins
12
Easy·20 mins
13
Easy·20 mins
Week 2
0 / 12
1
Easy·20 mins
2
Easy·15 mins
3
Easy·20 mins
4
Easy·20 mins
5
Easy·20 mins
6
Easy·20 mins
7
Easy·15 mins
8
Easy·30 mins
9
Easy·20 mins
10
Easy·15 mins
11
Easy·15 mins
12
Medium·20 mins
Week 3
0 / 8
1
Medium·25 mins
2
Medium·30 mins
3
Medium·30 mins
4
Longest Substring Without Repeating Characters
Medium·30 mins
5
Medium·30 mins
6
Binary Tree Level Order Traversal
Medium·20 mins
7
Medium·25 mins
8
Evaluate Reverse Polish Notation
Medium·30 mins
Week 4
0 / 8
1
Medium·30 mins
2
Medium·35 mins
3
Medium·25 mins
4
Medium·30 mins
5
Medium·20 mins
6
Medium·20 mins
7
Medium·25 mins
8
Medium·30 mins
Week 5
0 / 8
1
Search in Rotated Sorted Array
Medium·30 mins
2
Medium·30 mins
3
Medium·30 mins
4
Medium·30 mins
5
Lowest Common Ancestor of a Binary Tree
Medium·25 mins
6
Medium·35 mins
7
Medium·30 mins
8
Medium·25 mins
Week 6
0 / 9
1
Medium·30 mins
2
Medium·30 mins
3
Medium·25 mins
4
Medium·25 mins
5
Medium·30 mins
6
Medium·20 mins
7
Medium·25 mins
8
Medium·20 mins
9
Construct Binary Tree from Preorder and Inorder Traversal
Medium·25 mins
Week 7
0 / 7
1
Medium·35 mins
2
Letter Combinations of a Phone Number
Medium·30 mins
3
Medium·30 mins
4
Medium·30 mins
5
Medium·30 mins
6
Medium·35 mins
7
Medium·30 mins
Week 8
0 / 10
1
Medium·25 mins
2
Hard·30 mins
3
Serialize and Deserialize Binary Tree
Hard·40 mins
4
Hard·35 mins
5
Hard·30 mins
6
Hard·45 mins
7
Hard·40 mins
8
Maximum Profit in Job Scheduling
Hard·45 mins
9
Hard·30 mins
10
Largest Rectangle in Histogram
Hard·35 mins
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.
contact@techinterviewhandbook.org
© 2023 Tech Interview Handbook. All rights reserved.
Copy 1
1 Container With Most Water Medium · 35 mins
2 Letter Combinations of a Phone Number Medium · 30 mins
3 Word Search Medium · 30 mins
4 Find All Anagrams in a String Medium · 30 mins
5 Minimum Height Trees Medium · 30 mins
6 Task Scheduler Medium · 35 mins
7 LRU Cache Medium · 30 mins
Week 8 0 / 10 1 Kth Smallest Element in a BST Medium · 25 mins
2 Minimum Window Substring Hard · 30 mins
3 Serialize and Deserialize Binary Tree Hard · 40 mins
4 Trapping Rain Water Hard · 35 mins
5 Find Median from Data Stream Hard · 30 mins
6 Word Ladder Hard · 45 mins
7 Basic Calculator Hard · 40 mins
8 Maximum Profit in Job Scheduling Hard · 45 mins
9 Merge k Sorted Lists Hard · 30 mins
10 Largest Rectangle in Histogram Hard · 35 mins