Leetcode Mastery - MAANG Interview Prep
Systematic study of 320 Leetcode problems organized by 33 algorithmic patterns for Staff/Senior Engineer interviews at MAANG companies.
🎯 Mission
Master 320 Tier-1 Leetcode problems with: - Deep understanding of patterns - Multiple approaches (brute force → optimal) - Java implementations - Interview-ready explanations - Spaced repetition tracking
📚 How to Use
Browse by Pattern:
Use navigation to explore problems by algorithmic pattern.
Track Progress:
All progress is tracked in CSV and visualized in auto-generated tables.
Study Systematically:
Follow the pattern-based approach to build strong fundamentals.
📊 Progress Overview
Run python update_progress.py to see current progress.
🗂️ Pattern Categories
Foundation (Weeks 1-2)
Arrays & Hashing • Two Pointers • Sliding Window • Prefix Sum
Search & Pointers (Weeks 3-4)
Binary Search • Fast & Slow Pointers • Cyclic Sort
Linear Data Structures (Weeks 4-6)
Linked Lists • Stacks • Monotonic Stack • Queues & Deques
Trees (Weeks 6-8)
Binary Trees - Traversal • Binary Trees - Properties • BST • Tries
Graphs (Weeks 9-10)
BFS/DFS • Multi-source BFS • Topological Sort • Union Find • Bipartite
Dynamic Programming (Weeks 11-14)
1D DP • 2D/Grids • Subsequences • Strings • LIS • MCM • State Machines
Advanced Patterns (Weeks 15-16)
Backtracking • Heaps • Greedy • Intervals • Line Sweep • Design
🎓 Study Approach
- Learn Pattern - Understand when and why to use it
- Solve Problems - Work through with deep understanding
- Document Learning - Complete markdown notes with Java code
- Track in CSV - Update status, confidence, review dates
- Review Regularly - Spaced repetition for retention
🚀 Get Started
View all problems: Browse Problems →
Update progress: Run python update_progress.py after solving problems
Journey Start: November 2025
Target: MAANG Staff/Senior Engineer Interview Ready
Approach: Pattern-based mastery with explanatory learning