androidengineers.Book a session

LEARN WITH A CLEAR DIRECTION

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.

Intermediate to AdvancedSelf-paced8 modules75 available lessons

Your path, one skill at a time.

The Blind 75 list is your ultimate roadmap to ace coding interviews. These handpicked problems help you recognize recurring patterns, master complexity trade-offs, and build the intuition to solve unseen questions under pressure.

What you’ll learn

  • 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

THE CURRICULUM

Build your knowledge, step by step.

75 lessons across 8 modules. Open a module to explore its lessons and practical work.

01MODULE 01Week 113 lessons · Self-paced

Foundational warm-up across arrays, stacks, linked lists, and trees.

  1. 01Two Sum15 mins
  2. 02Valid Parentheses20 mins
  3. 03Merge Two Sorted Lists20 mins
  4. 04Best Time to Buy and Sell Stock20 mins
  5. 05Valid Palindrome15 mins
  6. 06Invert Binary Tree15 mins
  7. 07Valid Anagram15 mins
  8. 08Binary Search15 mins
  9. 09Flood Fill20 mins
  10. 10Lowest Common Ancestor of a Binary Search Tree20 mins
  11. 11Balanced Binary Tree15 mins
  12. 12Linked List Cycle20 mins
  13. 13Implement Queue using Stacks20 mins
02MODULE 02Week 212 lessons · Self-paced

Easy problems to build speed; one medium to stretch.

  1. 01First Bad Version20 mins
  2. 02Ransom Note15 mins
  3. 03Climbing Stairs20 mins
  4. 04Longest Palindrome20 mins
  5. 05Reverse Linked List20 mins
  6. 06Majority Element20 mins
  7. 07Add Binary15 mins
  8. 08Diameter of Binary Tree30 mins
  9. 09Middle of the Linked List20 mins
  10. 10Maximum Depth of Binary Tree15 mins
  11. 11Contains Duplicate15 mins
  12. 12Maximum Subarray20 mins
03MODULE 03Week 38 lessons · Self-paced

Introduce mediums: intervals, graphs, heaps, sliding window.

  1. 01Insert Interval25 mins
  2. 0201 Matrix30 mins
  3. 03K Closest Points to Origin30 mins
  4. 04Longest Substring Without Repeating Characters30 mins
  5. 053Sum30 mins
  6. 06Binary Tree Level Order Traversal20 mins
  7. 07Clone Graph25 mins
  8. 08Evaluate Reverse Polish Notation30 mins
04MODULE 04Week 48 lessons · Self-paced

Graphs, tries, DP, arrays, and BST validation.

  1. 01Course Schedule30 mins
  2. 02Implement Trie (Prefix Tree)35 mins
  3. 03Coin Change25 mins
  4. 04Product of Array Except Self30 mins
  5. 05Min Stack20 mins
  6. 06Validate Binary Search Tree20 mins
  7. 07Number of Islands25 mins
  8. 08Rotting Oranges30 mins
05MODULE 05Week 58 lessons · Self-paced

Binary search on arrays, backtracking, intervals, and maps.

  1. 01Search in Rotated Sorted Array30 mins
  2. 02Combination Sum30 mins
  3. 03Permutations30 mins
  4. 04Merge Intervals30 mins
  5. 05Lowest Common Ancestor of a Binary Tree25 mins
  6. 06Time Based Key-Value Store35 mins
  7. 07Accounts Merge30 mins
  8. 08Sort Colors25 mins
06MODULE 06Week 69 lessons · Self-paced

DP, strings, matrix, recursion, and tree views.

  1. 01Word Break30 mins
  2. 02Partition Equal Subset Sum30 mins
  3. 03String to Integer (atoi)25 mins
  4. 04Spiral Matrix25 mins
  5. 05Subsets30 mins
  6. 06Binary Tree Right Side View20 mins
  7. 07Longest Palindromic Substring25 mins
  8. 08Unique Paths20 mins
  9. 09Construct Binary Tree from Preorder and Inorder Traversal25 mins
07MODULE 07Week 77 lessons · Self-paced

Two-pointer optimization, backtracking, graphs, heaps, and LRU.

  1. 01Container With Most Water35 mins
  2. 02Letter Combinations of a Phone Number30 mins
  3. 03Word Search30 mins
  4. 04Find All Anagrams in a String30 mins
  5. 05Minimum Height Trees30 mins
  6. 06Task Scheduler35 mins
  7. 07LRU Cache30 mins
08MODULE 08Week 810 lessons · Self-paced

Hard set: windows, serialization, heaps, stacks, scheduling, and histograms.

  1. 01Kth Smallest Element in a BST25 mins
  2. 02Minimum Window Substring30 mins
  3. 03Serialize and Deserialize Binary Tree40 mins
  4. 04Trapping Rain Water35 mins
  5. 05Find Median from Data Stream30 mins
  6. 06Word Ladder45 mins
  7. 07Basic Calculator40 mins
  8. 08Maximum Profit in Job Scheduling45 mins
  9. 09Merge k Sorted Lists30 mins
  10. 10Largest Rectangle in Histogram35 mins