Hey there, the author of Blind 75 here 👋!
Practicing is the best way to prepare for coding interviews. LeetCode has over a thousand questions. Which should you practice? Hence years ago, I curated a list of the most important 75 questions on LeetCode. Many other LeetCode questions are a mash of the techniques from these individual questions. I used this list in my last job hunt to only do the important questions.
I shared this list on Blind by extracting the questions from my freeCodeCamp article to save peoples' time when revising and someone reposted this list on the LeetCode forum. It somehow blew up and became super famous in the coding interview scene, people even gave it a name - Blind 75. The Blind 75 questions as a LeetCode list can be found here.
Years later, I further distilled the list down into only 50 questions and spread them across a 5-week schedule. Here is the suggested schedule for revising and practicing algorithm questions on LeetCode. Sign up for an account if you don't already have one, it's critical to your success in interviewing!
When practicing, you are advised to treat it like a real coding interview and check through thoroughly before submitting. Consider even manually coming up with some test cases and running through them to verify correctness!
I've created a LeetCode list for the following questions (except the Premium ones). Feel free to use it to track your practice progress.
If you're running low on time, AlgoMonster aims to help you ace the technical interview in the shortest time possible. By Google engineers, AlgoMonster uses a data-driven approach to teach you most useful key question patterns and has contents to help you quickly revise basic data structures and algorithms. Learn and understand patterns, not memorize answers!
Week 1 - Sequences
In week 1, we will warm up by doing a mix of easy and medium questions on arrays and strings. Arrays and strings are the most common types of questions to be found in interviews; gaining familiarity with them will help in building strong fundamentals to better handle tougher questions.
|Best Time to Buy and Sell Stock||Easy||Link|
|Product of Array Except Self||Medium||Link|
|Maximum Product Subarray||Medium||Link|
|Search in Rotated Sorted Array||Medium||Link|
Week 2 - Data structures
The focus of week 2 is on linked lists, strings and matrix-based questions. The goal is to learn the common routines dealing with linked lists, traversing matrices and sequence analysis (arrays/strings) techniques such as sliding window, linked list traversal and matrix traversal.
|Reverse a Linked List||Easy||Link|
|Detect Cycle in a Linked List||Easy||Link|
|Container With Most Water||Medium||Link|
|Find Minimum in Rotated Sorted Array||Medium||Link|
|Longest Repeating Character Replacement||Medium||Link|
|Longest Substring Without Repeating Characters||Medium||Link|
|Number of Islands||Medium||Link|
|Remove Nth Node From End Of List||Medium||Link|
|Pacific Atlantic Water Flow||Medium||Link|
|Minimum Window Substring||Hard||Link|
Week 3 - Non-linear data structures
The focus of week 3 is on non-linear data structures like trees, graphs and heaps. You should be familiar with the various tree traversal (in-order, pre-order, post-order) algorithms and graph traversal algorithms such as breadth-first search and depth-first search. In my experience, using more advanced graph algorithms (Dijkstra's and Floyd-Warshall) is quite rare and usually not necessary.
|Invert/Flip Binary Tree||Easy||Link|
|Validate Binary Search Tree||Medium||Link|
|Construct Binary Tree from Preorder and Inorder Traversal||Medium||Link|
|Top K Frequent Elements||Medium||Link|
|Serialize and Deserialize Binary Tree||Hard||Link|
|Binary Tree Maximum Path Sum||Hard||Link|
|Maximum Depth of Binary Tree||Easy||Link|
|Binary Tree Level Order Traversal||Medium||Link|
|Encode and Decode Strings||Medium||Link (Premium)|
Week 4 - More data structures
Week 4 builds up on knowledge from previous weeks but questions are of increased difficulty. Expect to see such level of questions during interviews. You get more practice on more advanced data structures such as (but not exclusively limited to) heaps and tries which are less common but are still asked.
|Subtree of Another Tree||Easy||Link|
|Lowest Common Ancestor of BST||Easy||Link|
|Implement Trie (Prefix Tree)||Medium||Link|
|Add and Search Word||Medium||Link|
|Kth Smallest Element in a BST||Medium||Link|
|Merge K Sorted Lists||Hard||Link|
|Find Median from Data Stream||Hard||Link|
|Longest Consecutive Sequence||Medium||Link|
|Word Search II||Hard||Link|
|Meeting Rooms||Easy||Link (Premium)|
|Meeting Rooms II||Medium||Link (Premium)|
|Graph Valid Tree||Medium||Link (Premium)|
|Number of Connected Components in an Undirected Graph||Medium||Link (Premium)|
|Alien Dictionary||Hard||Link (Premium)|
Week 5 - Dynamic programming
Week 5 focuses on Dynamic Programming (DP) questions. Personally as an interviewer, I'm not a fan of DP questions as they are not really applicable to practical scenarios and frankly if I were made to do the tough DP questions during my interviews I'd not have gotten the job. However, companies like Google still ask DP questions and if joining Google is your dream, DP is unavoidable.
DP questions can be hard to master and the best way to get better at them is... you guessed it - practice! Be familiar with the concepts of memoization and backtracking.
Practically speaking the return of investment (ROI) on studying and practicing for DP questions is very low. Hence DP questions are less important/optional and you should only do them if you have time to spare and you're very keen to have all bases covered (and interviewing with Google).
|Longest Increasing Subsequence||Medium||Link|
|House Robber II||Medium||Link|
Dynamic programming course
If you want more structured algorithms practice, I recommend the following courses:
AlgoMonster aims to help you ace the technical interview in the shortest time possible. By Google engineers, AlgoMonster uses a data-driven approach to teach you the most useful key question patterns and has contents to help you quickly revise basic data structures and algorithms. Best of all, AlgoMonster is not subscription-based - pay a one-time fee and get lifetime access. Join today for a 70% discount →