This repository demonstrates my approach to documenting algorithms using a docs-as-code workflow.
Each document is written in Markdown and explains a LeetCode problem with clear, structured content:
- ✅ Problem summary
- 💻 Code walkthrough (C++)
- ⏱ Time and space complexity
- 🧠 Conclusion
- 📝 Markdown for lightweight semantic documentation
- 🔧 Git/GitHub for version control and change tracking
- 🧠 VS Code / Obsidian as the authoring environment
- 🟦 Two Pointers
- 🟨 Sliding Window
- 🧵 String Manipulation
- 🗂 Stacks
- 🔢 Dynamic Programming
- 🌳 Trees
- 📊 Sorting
- 🧩 In-place
- 🪣 Bucket Sort
| 🆔 Problem ID | 📄 Title | 📚 Category |
|---|---|---|
| 167 | Two Sum II - Input Array Is Sorted | Two Pointers |
| 151 | Reverse Words in a String | Two Pointers |
| 234 | Palindrome Linked List | Two Pointers |
| 143 | Reorder List | Two Pointers |
| 238 | Product of Array Except Self | Sliding Window |
| 438 | Find All Anagrams in a String | Sliding Window |
| 8 | String to Integer (atoi) | String Manipulation |
| 232 | Implement Queue using Stacks | Two Stacks |
| 394 | Decode String | Two Stacks |
| 139 | Word Break | Dynamic Programming |
| 2327 | Number of People Aware of a Secret | Dynamic Programming |
| 236 | Lowest Common Ancestor of a Binary Tree | Tree DFS (Depth First Search) |
| 75 | Sort Colors | Sorting |
| 347 | Top K Frequent Elements | Bucket Sort |
| 73 | Set Matrix Zeroes | In-place |
| 199 | Binary Tree Right Side View | BFS (Breadth First Search) |
| 994 | Rotting Oranges | BFS (Breadth First Search) |
| 210 | Course Schedule II | BFS (Breadth First Search) |
- GitHub: anthony-reese