My personal collection of LeetCode solutions, auto-synced via GitHub Actions. Solving problems, tracking progress, and sharpening my DSA skills — one problem at a time.
| Metric | Count |
|---|---|
| ✅ Total Solved | 7 |
| 🟢 Easy | 4 |
| 🟡 Medium | 2 |
| 🔴 Hard | 1 |
Last updated: 2026-07-12
This section updates automatically after every sync — no need to edit it manually.
solutions/
├── 0001-two-sum/
├── 0009-palindrome-number/
├── 0020-valid-parentheses/
├── 0042-trapping-rain-water/
├── 0053-maximum-subarray/
├── 0074-search-a-2d-matrix/
└── 0792-binary-search/
Each solution folder includes the source code and a link back to the original problem.
Solutions are synced automatically from LeetCode using the leetcode-sync GitHub Action:
- ✅ Only accepted submissions are synced
- 🔁 Runs daily via a scheduled GitHub Action (and can be triggered manually)
- 🗂️ New solutions land in the
solutions/folder automatically - 📊 The stats and structure above are regenerated automatically after every sync by
update_readme.js
Consistent practice, tracked progress, and a public record of growth. This repo is both a learning log and a portfolio piece — showing up, solving problems, and getting a little better each day.
- Arrays & Strings
- Two Pointers
- Binary Search
- Dynamic Programming
- Hash Tables
- Stacks
(Updated as more problems are solved.)
Feel free to explore, get inspired, or reach out if you'd like to discuss any of the solutions!
⭐ If you find this useful, consider giving it a star.