Study Plan
The 4-Week Coding Interview Plan
A pattern-first plan that takes you from Arrays to Mock Interviews in 28 days. Target: 65 problems, all filtered by importance — no noise.
Week 1 — Foundations
Arrays, strings, and the patterns that crack 40% of Easy questions.
Spend 30 min on each problem. If you cannot solve it, read the approach — then implement from scratch the next day without looking.
| Days | Patterns |
|---|---|
| Mon – Tue | |
| Wed – Thu | |
| Fri – Sat | |
| Sun | Rest & Review |
Week 2 — Core Data Structures
Stacks, heaps, and linked lists — the backbone of Medium-difficulty interviews.
Start timing yourself this week. Medium problems should take under 25 minutes. If a problem takes longer, note why and add it to your review queue.
| Days | Patterns |
|---|---|
| Mon – Tue | |
| Wed | |
| Thu – Fri | |
| Sat | |
| Sun | Rest & Review |
Week 3 — Trees, Graphs & DP
The hardest week. Slow down on DP — correctness beats speed.
For every DP problem: write the state definition in plain English before writing code. If you cannot explain dp[i] in one sentence, redefine the state.
| Days | Patterns |
|---|---|
| Mon – Tue | |
| Wed | |
| Thu – Fri | |
| Sat | |
| Sun | Rest & Review |
Week 4 — Review & Mock Interviews
Polish, speed, and communication — the final mile.
Communication is 50% of the score. Narrate your thought process out loud: "I'm reaching for a hash map here because..." before you write a single line.
| Days | Patterns |
|---|---|
| Mon | Rest & Review |
| Tue – Wed | |
| Thu | Rest & Review |
| Fri | Rest & Review |
| Sat | Rest & Review |
| Sun | Rest & Review |
Must-Know Problems
High-frequency problems that appear most often in interviews. Solve these before anything else.
| # | Problem | Difficulty |
|---|---|---|
| 01 | Longest Substring Without Repeating Characters | Medium |
| 02 | Minimum Window Substring | Hard |
| 03 | Two Sum II - Input Array Is Sorted | Medium |
| 04 | 3Sum | Medium |
| 05 | Container With Most Water | Medium |
| 06 | Trapping Rain Water | Hard |
| 07 | Valid Palindrome | Easy |
| 08 | Remove Duplicates from Sorted Array | Easy |
| 09 | Binary Search | Easy |
| 10 | Search in Rotated Sorted Array | Medium |
| 11 | Find Minimum in Rotated Sorted Array | Medium |
| 12 | Subarray Sum Equals K | Medium |
| 13 | Product of Array Except Self | Medium |
| 14 | Two Sum | Easy |
| 15 | Group Anagrams | Medium |
| 16 | Top K Frequent Elements | Medium |
| 17 | Valid Anagram | Easy |
| 18 | Longest Consecutive Sequence | Medium |
| 19 | Valid Parentheses | Easy |
| 20 | Min Stack | Medium |
Ready to start?
Open Week 1 — Sliding Window is the best first pattern to lock in.