This repository documents my structured algorithm learning and projects over 6 weeks. Each week focuses on a specific topic, with selected problems, code solutions, and weekly summaries.
| Week | Topic | Progress |
|---|---|---|
| 1 | Arrays & Strings |  |
| 2 | Stack, Queue & Linked List |  |
| 3 | Recursion & Binary Trees |  |
| 4 | Dynamic Programming | |
| 5 | Graphs & Union-Find | |
| 6 | Capstone Project | |
| Week | Day | Problem | Status |
|---|---|---|---|
| 1 | 1 | Two Sum |  |
| 1 | 2 | Three Sum |  |
| 1 | 3 | Move Zero / Remove Duplicates |  |
| 1 | 4 | Sliding Window Max |  |
| 1 | 5 | Longest Palindrome |  |
| 1 | 6-7 | Weekly Summary |  |
| Week | Day | Problem | Status |
|---|---|---|---|
| 2 | 1 | Valid Parentheses | |
| 2 | 2 | Min Stack |  |
| 2 | 3 | Sliding Window and Subarray / Range Sum Problems |  |
| 2 | 4 | Binary Search |  |
| 2 | 5 | Search Insert Position |  |
| 2 | 6-7 | Weekly Summary |  |
Repeat for Weeks 3–6
- Each day, solve the assigned problem and push code to the repo.
- Weekly, write a Markdown summary documenting insights.
- Update the corresponding badge to reflect completion (0% → 100%, or red → green).
- Week 6: Build a small project to integrate all learned algorithms.