Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Yangshun Tay · Tech Interview Handbook
Blind 75
A focused set of 75 core interview problems, organized by topic.
75 practice entries
0 / 75 completed0%
Array
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Two Sum | Easy | Open ↗ | — | |
| Best Time to Buy and Sell Stock | Easy | Open ↗ | — | |
| Contains Duplicate | Easy | Open ↗ | — | |
| Product of Array Except Self | Medium | Open ↗ | — | |
| Maximum Subarray | Medium | Open ↗ | — | |
| Maximum Product Subarray | Medium | Open ↗ | — | |
| Find Minimum in Rotated Sorted Array | Medium | Open ↗ | — | |
| Search in Rotated Sorted Array | Medium | Open ↗ | — | |
| 3Sum | Medium | Open ↗ | — | |
| Container With Most Water | Medium | Open ↗ | — |
Binary
0 / 5
Dynamic Programming
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Climbing Stairs | Easy | Open ↗ | — | |
| Coin Change | Medium | Open ↗ | — | |
| Longest Increasing Subsequence | Medium | Open ↗ | — | |
| Longest Common Subsequence | Medium | Open ↗ | — | |
| Word Break | Medium | Open ↗ | — | |
| Combination Sum | Medium | Open ↗ | — | |
| House Robber | Medium | Open ↗ | — | |
| House Robber II | Medium | Open ↗ | — | |
| Decode Ways | Medium | Open ↗ | — | |
| Unique Paths | Medium | Open ↗ | — | |
| Jump Game | Medium | Open ↗ | — |
Graph
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Clone Graph | Medium | Open ↗ | — | |
| Course Schedule | Medium | Open ↗ | — | |
| Pacific Atlantic Water Flow | Medium | Open ↗ | — | |
| Number of Islands | Medium | Open ↗ | — | |
| Longest Consecutive Sequence | Medium | Open ↗ | — | |
| Alien Dictionary | Hard | Open ↗ | — | |
| Graph Valid Tree | Medium | Open ↗ | — | |
| Number of Connected Components in an Undirected Graph | Medium | Open ↗ | — |
Interval
0 / 5
Linked List
0 / 6
Matrix
0 / 4
String
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Longest Substring Without Repeating Characters | Medium | Open ↗ | — | |
| Longest Repeating Character Replacement | Medium | Open ↗ | — | |
| Minimum Window Substring | Hard | Open ↗ | — | |
| Valid Anagram | Easy | Open ↗ | — | |
| Group Anagrams | Medium | Open ↗ | — | |
| Valid Parentheses | Easy | Open ↗ | — | |
| Valid Palindrome | Easy | Open ↗ | — | |
| Longest Palindromic Substring | Medium | Open ↗ | — | |
| Palindromic Substrings | Medium | Open ↗ | — | |
| Encode and Decode Strings | Medium | Open ↗ | — |
Tree
0 / 14
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Maximum Depth of Binary Tree | Easy | Open ↗ | — | |
| Same Tree | Easy | Open ↗ | — | |
| Invert Binary Tree | Easy | Open ↗ | — | |
| Binary Tree Maximum Path Sum | Hard | Open ↗ | — | |
| Binary Tree Level Order Traversal | Medium | Open ↗ | — | |
| Serialize and Deserialize Binary Tree | Hard | Open ↗ | — | |
| Subtree of Another Tree | Easy | Open ↗ | — | |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | Open ↗ | — | |
| Validate Binary Search Tree | Medium | Open ↗ | — | |
| Kth Smallest Element in a BST | Medium | Open ↗ | — | |
| Lowest Common Ancestor of a Binary Search Tree | Medium | Open ↗ | — | |
| Implement Trie (Prefix Tree) | Medium | Open ↗ | — | |
| Design Add and Search Words Data Structure | Medium | Open ↗ | — | |
| Word Search II | Hard | Open ↗ | — |