This repository is my personal journey to master the most important coding interview patterns step by step.
Each folder covers one pattern with problems ranging from easy → medium → hard, including solutions, dry runs, and explanations.
- Sliding Window
- Two Pointers / Fast & Slow Pointers
- Merge Intervals
- Binary Search
- Kadane’s Algorithm
- Top-K Elements (Heap / PQ)
- Backtracking
- Dynamic Programming
- Graph Traversals
- Matrix Traversal
- Understand the pattern template
- Solve basic → medium → advanced problems
- Document each problem with:
- Problem statement
- Approach & Dry Run
- Code solution (Java)
By the end of Phase 2, I’ll be able to confidently solve 90% of coding interview problems by recognizing their underlying pattern.