🚀 Enrollments Open for Jetpack Compose Cohort 2 — 7 Days of Live Learning to Build Modern Android UIs 💚Join Now
Roadmap/Blind 75: Master Coding Interview Patterns
Intermediate to Advanced

Blind 75: Master Coding Interview Patterns

A curated list of the 75 most essential coding interview questions that cover all major problem-solving patterns across arrays, strings, dynamic programming, graphs, and more.

8–10 weeks
21.4k students
4.9 rating
Progress0/75 lessons

Key Topics You'll Master

1
Week 1
2
Week 2
3
Week 3
4
Week 4
5
Week 5
6
Week 6
7
Week 7
8
Week 8
Learning Outcomes
  • Identify key problem-solving patterns used across top interview questions
  • Strengthen your ability to optimize brute-force solutions
  • Develop confidence in handling unseen problems under time constraints
  • Master major algorithmic categories from arrays to dynamic programming
  • Prepare effectively for technical interviews at top product companies
Prerequisites
  • Solid understanding of basic data structures (arrays, stacks, queues, linked lists, trees, graphs)
  • Comfort with recursion and iterative approaches
  • Familiarity with Big-O notation and problem-solving in a preferred language (Java/Kotlin/Python/C++)
1
Week 1
Foundational warm-up across arrays, stacks, linked lists, and trees.
1 week
Two Sum
exercise15 minsEasy
Valid Parentheses
exercise20 minsEasy
Merge Two Sorted Lists
exercise20 minsEasy
Best Time to Buy and Sell Stock
exercise20 minsEasy
Valid Palindrome
exercise15 minsEasy
Invert Binary Tree
exercise15 minsEasy
Valid Anagram
exercise15 minsEasy
Binary Search
exercise15 minsEasy
Flood Fill
exercise20 minsEasy
Lowest Common Ancestor of a Binary Search Tree
exercise20 minsMedium
Balanced Binary Tree
exercise15 minsEasy
Linked List Cycle
exercise20 minsEasy
Implement Queue using Stacks
exercise20 minsEasy
2
Week 2
Easy problems to build speed; one medium to stretch.
1 week
First Bad Version
exercise20 minsEasy
Ransom Note
exercise15 minsEasy
Climbing Stairs
exercise20 minsEasy
Longest Palindrome
exercise20 minsEasy
Reverse Linked List
exercise20 minsEasy
Majority Element
exercise20 minsEasy
Add Binary
exercise15 minsEasy
Diameter of Binary Tree
exercise30 minsEasy
Middle of the Linked List
exercise20 minsEasy
Maximum Depth of Binary Tree
exercise15 minsEasy
Contains Duplicate
exercise15 minsEasy
Maximum Subarray
exercise20 minsMedium
3
Week 3
Introduce mediums: intervals, graphs, heaps, sliding window.
1 week
Insert Interval
exercise25 minsMedium
01 Matrix
exercise30 minsMedium
K Closest Points to Origin
exercise30 minsMedium
Longest Substring Without Repeating Characters
exercise30 minsMedium
3Sum
exercise30 minsMedium
Binary Tree Level Order Traversal
exercise20 minsMedium
Clone Graph
exercise25 minsMedium
Evaluate Reverse Polish Notation
exercise30 minsMedium
4
Week 4
Graphs, tries, DP, arrays, and BST validation.
1 week
Course Schedule
exercise30 minsMedium
Implement Trie (Prefix Tree)
exercise35 minsMedium
Coin Change
exercise25 minsMedium
Product of Array Except Self
exercise30 minsMedium
Min Stack
exercise20 minsMedium
Validate Binary Search Tree
exercise20 minsMedium
Number of Islands
exercise25 minsMedium
Rotting Oranges
exercise30 minsMedium
5
Week 5
Binary search on arrays, backtracking, intervals, and maps.
1 week
Search in Rotated Sorted Array
exercise30 minsMedium
Combination Sum
exercise30 minsMedium
Permutations
exercise30 minsMedium
Merge Intervals
exercise30 minsMedium
Lowest Common Ancestor of a Binary Tree
exercise25 minsMedium
Time Based Key-Value Store
exercise35 mins
Accounts Merge
exercise30 minsMedium
Sort Colors
exercise25 minsMedium
6
Week 6
DP, strings, matrix, recursion, and tree views.
1 week
Word Break
exercise30 minsMedium
Partition Equal Subset Sum
exercise30 minsMedium
String to Integer (atoi)
exercise25 minsMedium
Spiral Matrix
exercise25 minsMedium
Subsets
exercise30 minsMedium
Binary Tree Right Side View
exercise20 minsMedium
Longest Palindromic Substring
exercise25 minsMedium
Unique Paths
exercise20 minsMedium
Construct Binary Tree from Preorder and Inorder Traversal
exercise25 minsMedium
7
Week 7
Two-pointer optimization, backtracking, graphs, heaps, and LRU.
1 week
Container With Most Water
exercise35 minsMedium
Letter Combinations of a Phone Number
exercise30 minsMedium
Word Search
exercise30 minsMedium
Find All Anagrams in a String
exercise30 minsMedium
Minimum Height Trees
exercise30 minsMedium
Task Scheduler
exercise35 minsMedium
LRU Cache
exercise30 minsMedium
8
Week 8
Hard set: windows, serialization, heaps, stacks, scheduling, and histograms.
1 week
Kth Smallest Element in a BST
exercise25 minsMedium
Minimum Window Substring
exercise30 mins
Serialize and Deserialize Binary Tree
exercise40 mins
Trapping Rain Water
exercise35 mins
Find Median from Data Stream
exercise30 mins
Word Ladder
exercise45 mins
Basic Calculator
exercise40 mins
Maximum Profit in Job Scheduling
exercise45 mins
Merge k Sorted Lists
exercise30 mins
Largest Rectangle in Histogram
exercise35 mins
Android Engineers - Master Android App Development