GRIND 75

by the author of Blind 75

Change question preferences

Grind 160 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 140 hours
Fits into your schedule.

DIFFICULTY Easy: 42 Medium: 98 Hard: 20

Array: 23 Binary: 7 Binary Search: 8 Binary Search Tree: 5 Binary Tree: 18
TOPICS Dynamic Programming: 11 Graph: 21 Hash Table: 1 Heap: 7 Linked List: 13 Math: 5 Matrix: 4
Queue: 1 Recursion: 5 Stack: 14 String: 13 Trie: 4
Need study resources? Check out Tech Interview Handbook's algorithm study cheatsheets.

COMPLETED 2 / 160

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.

Based on Preferences Order by Difficulty Group by Weeks Show topics

Week 1 2 / 12

1 Two Sum
Easy · 15 mins

2 Valid Parentheses
Easy · 20 mins

3 Merge Two Sorted Lists

Easy · 20 mins
 4 Best Time to Buy and Sell Stock
Easy · 20 mins

5 Valid Palindrome
Easy · 15 mins

6 Invert Binary Tree

Easy · 15 mins

7 Valid Anagram
Easy · 15 mins

8 Binary Search
Easy · 15 mins

9 Flood Fill
Easy · 20 mins

10 Maximum Subarray
Easy · 20 mins

11 Lowest Common Ancestor of a Binary Search Tree

Easy · 20 mins

12 Balanced Binary Tree

Easy · 15 mins

Week 2 0 / 10

1 Linked List Cycle

Easy · 20 mins

2 Implement Queue using Stacks

Easy · 20 mins

3 First Bad Version

Easy · 20 mins

4 Ransom Note
Easy · 15 mins
Climbing Stairs
 5 Easy · 20 mins

6 Longest Palindrome
Easy · 20 mins

7 Reverse Linked List

Easy · 20 mins

8 Majority Element
Easy · 20 mins

9 Add Binary
Easy · 15 mins

10 Diameter of Binary Tree

Easy · 30 mins

Week 3 0 / 12

1 Middle of the Linked List

Easy · 20 mins

2 Maximum Depth of Binary Tree

Easy · 15 mins

3 Contains Duplicate
Easy · 15 mins

4 Meeting Rooms
Easy · 20 mins

5 Roman to Integer
Easy · 20 mins

6 Backspace String Compare

Easy · 15 mins

7 Counting Bits
Easy · 15 mins

8 Same Tree
Easy · 20 mins
 9 Number of 1 Bits
Easy · 15 mins

10 Longest Common Prefix

Easy · 20 mins

11 Single Number
Easy · 15 mins

12 Palindrome Linked List

Easy · 20 mins

Week 4 0 / 10

1 Move Zeroes
Easy · 20 mins

2 Symmetric Tree
Easy · 20 mins

3 Missing Number
Easy · 15 mins

4 Palindrome Number
Easy · 15 mins

5 Convert Sorted Array to Binary Search Tree

Easy · 20 mins

6 Reverse Bits
Easy · 15 mins

7 Subtree of Another Tree

Easy · 20 mins

8 Squares of a Sorted Array

Easy · 20 mins

9 Insert Interval
Medium · 25 mins
10 01 Matrix
Medium · 30 mins

Week 5 0 / 7

1 K Closest Points to Origin

Medium · 30 mins

2 Longest Substring Without Repeating Characters

Medium · 30 mins

3 3Sum
Medium · 30 mins

4 Binary Tree Level Order Traversal

Medium · 20 mins

5 Clone Graph
Medium · 25 mins

6 Evaluate Reverse Polish Notation

Medium · 30 mins

7 Course Schedule
Medium · 30 mins

Week 6 0 / 7

1 Implement Trie (Prefix Tree)

Medium · 35 mins

2 Coin Change
Medium · 25 mins

3 Product of Array Except Self

Medium · 30 mins

4 Min Stack
Medium · 20 mins
 5 Validate Binary Search Tree
Medium · 20 mins

6 Number of Islands
Medium · 25 mins

7 Rotting Oranges
Medium · 30 mins

Week 7 0 / 7

1 Search in Rotated Sorted Array

Medium · 30 mins

2 Combination Sum
Medium · 30 mins

3 Permutations
Medium · 30 mins

4 Merge Intervals
Medium · 30 mins

5 Lowest Common Ancestor of a Binary Tree

Medium · 25 mins

6 Time Based Key-Value Store

Medium · 35 mins

7 Accounts Merge
Medium · 30 mins

Week 8 0 / 8

1 Sort Colors
Medium · 25 mins

2 Word Break
Medium · 30 mins
 3 Partition Equal Subset Sum
Medium · 30 mins

4 String to Integer (atoi)

Medium · 25 mins

5 Spiral Matrix
Medium · 25 mins

6 Subsets
Medium · 30 mins

7 Binary Tree Right Side View

Medium · 20 mins

8 Longest Palindromic Substring

Medium · 25 mins

Week 9 0 / 7

1 Unique Paths
Medium · 20 mins

2 Construct Binary Tree from Preorder and Inorder Traversal

Medium · 25 mins

3 Container With Most Water

Medium · 35 mins

4 Letter Combinations of a Phone Number

Medium · 30 mins

5 Word Search
Medium · 30 mins

6 Find All Anagrams in a String

Medium · 30 mins

7 Minimum Height Trees

Medium · 30 mins
Week 10 0 / 7

1 Task Scheduler
Medium · 35 mins

2 LRU Cache
Medium · 30 mins

3 Kth Smallest Element in a BST

Medium · 25 mins

4 Daily Temperatures
Medium · 30 mins

5 House Robber
Medium · 25 mins

6 Gas Station
Medium · 30 mins

7 Next Permutation
Medium · 30 mins

Week 11 0 / 7

1 Valid Sudoku
Medium · 35 mins

2 Group Anagrams
Medium · 25 mins

3 Maximum Product Subarray

Medium · 30 mins

4 Design Add and Search Words Data Structure

Medium · 35 mins

5 Pacific Atlantic Water Flow

Medium · 30 mins
Remove Nth Node From End of List
 6 Medium · 20 mins

7 Shortest Path to Get Food

Medium · 30 mins

Week 12 0 / 7

1 Find the Duplicate Number

Medium · 20 mins

2 Top K Frequent Words

Medium · 30 mins

3 Longest Increasing Subsequence

Medium · 30 mins

4 Graph Valid Tree

Medium · 30 mins

5 Course Schedule II
Medium · 35 mins

6 Swap Nodes in Pairs

Medium · 25 mins

7 Path Sum II
Medium · 25 mins

Week 13 0 / 7

1 Longest Consecutive Sequence

Medium · 30 mins

2 Rotate Array
Medium · 25 mins

3 Odd Even Linked List

Medium · 25 mins

4 Decode String
Medium · 30 mins
 5 Contiguous Array
Medium · 30 mins

6 Maximum Width of Binary Tree

Medium · 20 mins

7 Find K Closest Elements

Medium · 30 mins

Week 14 0 / 7

1 Longest Repeating Character Replacement

Medium · 30 mins

2 Inorder Successor in BST

Medium · 30 mins

3 Jump Game
Medium · 20 mins

4 Add Two Numbers

Medium · 25 mins

5 Generate Parentheses
Medium · 25 mins

6 Sort List
Medium · 25 mins

7 Number of Connected Components in an Undirected Graph

Medium · 30 mins

Week 15 0 / 7

1 Minimum Knight Moves

Medium · 35 mins

2 Subarray Sum Equals K

Medium · 35 mins
 Asteroid Collision
3 Medium · 30 mins

4 Random Pick with Weight

Medium · 25 mins

5 Kth Largest Element in an Array

Medium · 30 mins

6 Maximal Square
Medium · 30 mins

7 Rotate Image
Medium · 25 mins

Week 16 0 / 7

1 Binary Tree Zigzag Level Order Traversal

Medium · 25 mins

2 Design Hit Counter

Medium · 30 mins

3 Path Sum III

Medium · 35 mins

4 Pow(x, n)
Medium · 20 mins

5 Search a 2D Matrix
Medium · 30 mins

6 Largest Number
Medium · 20 mins

7 Decode Ways
Medium · 25 mins

Week 17 0 / 7
 1 Meeting Rooms II
Medium · 30 mins

2 Reverse Integer
Medium · 25 mins

3 Set Matrix Zeroes

Medium · 25 mins

4 Reorder List
Medium · 25 mins

5 Encode and Decode Strings

Medium · 25 mins

6 Cheapest Flights Within K Stops

Medium · 45 mins

7 All Nodes Distance K in Binary Tree

Medium · 25 mins

Week 18 0 / 6

1 3Sum Closest
Medium · 30 mins

2 Rotate List
Medium · 25 mins

3 Find Minimum in Rotated Sorted Array

Medium · 30 mins

4 Basic Calculator II
Medium · 30 mins

5 Minimum Window Substring

Hard · 30 mins

6 Serialize and Deserialize Binary Tree

Hard · 40 mins
Week 19 0 / 5

1 Trapping Rain Water

Hard · 35 mins

2 Find Median from Data Stream

Hard · 30 mins

3 Word Ladder
Hard · 45 mins

4 Basic Calculator
Hard · 40 mins

5 Maximum Profit in Job Scheduling

Hard · 45 mins

Week 20 0 / 13

1 Merge k Sorted Lists

Hard · 30 mins

2 Largest Rectangle in Histogram

Hard · 35 mins

3 Binary Tree Maximum Path Sum

Hard · 35 mins

4 Maximum Frequency Stack

Hard · 40 mins

5 Median of Two Sorted Arrays

Hard · 40 mins

6 Longest Increasing Path in a Matrix

Hard · 40 mins

7 Longest Valid Parentheses

Hard · 35 mins
Design In-Memory File System
 8 Hard · 40 mins

9 Employee Free Time

Hard · 35 mins

10 Word Search II
Hard · 40 mins

11 Alien Dictionary
Hard · 45 mins

12 Bus Routes
Hard · 45 mins

13 Sliding Window Maximum

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

© 2022 Tech Interview Handbook. All rights reserved.