Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Yangshun Tay · Tech Interview Handbook
Grind 75
A customizable, time-boxed roadmap from the author of Blind 75.
75 practice entries
0 / 75 completed0%
Arrays & Strings
0 / 21
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Two Sum | Easy | Open ↗ | — | |
| Best Time to Buy and Sell Stock | Easy | Open ↗ | — | |
| Valid Palindrome | Easy | Open ↗ | — | |
| Valid Anagram | Easy | Open ↗ | — | |
| Ransom Note | Easy | Open ↗ | — | |
| Longest Palindrome | Easy | Open ↗ | — | |
| Majority Element | Easy | Open ↗ | — | |
| Add Binary | Easy | Open ↗ | — | |
| Contains Duplicate | Easy | Open ↗ | — | |
| Maximum Subarray | Medium | Open ↗ | — | |
| Longest Substring Without Repeating Characters | Medium | Open ↗ | — | |
| 3Sum | Medium | Open ↗ | — | |
| Product of Array Except Self | Medium | Open ↗ | — | |
| Sort Colors | Medium | Open ↗ | — | |
| String to Integer (atoi) | Medium | Open ↗ | — | |
| Spiral Matrix | Medium | Open ↗ | — | |
| Longest Palindromic Substring | Medium | Open ↗ | — | |
| Container With Most Water | Medium | Open ↗ | — | |
| Find All Anagrams in a String | Medium | Open ↗ | — | |
| Minimum Window Substring | Hard | Open ↗ | — | |
| Trapping Rain Water | Hard | Open ↗ | — |
Linked List & Stack
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Valid Parentheses | Easy | Open ↗ | — | |
| Merge Two Sorted Lists | Easy | Open ↗ | — | |
| Linked List Cycle | Easy | Open ↗ | — | |
| Implement Queue using Stacks | Easy | Open ↗ | — | |
| Reverse Linked List | Easy | Open ↗ | — | |
| Middle of the Linked List | Easy | Open ↗ | — | |
| Evaluate Reverse Polish Notation | Medium | Open ↗ | — | |
| Min Stack | Medium | Open ↗ | — | |
| LRU Cache | Medium | Open ↗ | — | |
| Basic Calculator | Hard | Open ↗ | — | |
| Largest Rectangle in Histogram | Hard | Open ↗ | — |
Trees
0 / 13
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Invert Binary Tree | Easy | Open ↗ | — | |
| Balanced Binary Tree | Easy | Open ↗ | — | |
| Diameter of Binary Tree | Easy | Open ↗ | — | |
| Maximum Depth of Binary Tree | Easy | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Search Tree | Medium | Open ↗ | — | |
| Binary Tree Level Order Traversal | Medium | Open ↗ | — | |
| Implement Trie (Prefix Tree) | Medium | Open ↗ | — | |
| Validate Binary Search Tree | Medium | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Tree | Medium | Open ↗ | — | |
| Binary Tree Right Side View | Medium | Open ↗ | — | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Open ↗ | — | |
| Kth Smallest Element in a BST | Medium | Open ↗ | — | |
| Serialize and Deserialize Binary Tree | Hard | Open ↗ | — |