Collection of algorithm solutions for learning and reference. Built this as I work through common patterns - sharing in case it helps others learning the same concepts.
Foundations - 18 problems solved covering:
- Arrays & Hash Maps (Two Sum, find largest, first non-repeating character)
- Strings (reverse, palindrome checking, character counting)
- Stacks (valid parentheses)
- Basic patterns (merging arrays, missing numbers)
01-foundations/ - 18 solved problems (complete)
02-core-patterns/ - Two pointers, sliding window (started)
03-recursion/ - Basic recursion, backtracking (upcoming)
04-linked-lists/ - Pointer manipulation (upcoming)
05-trees-and-graphs/ - Binary trees, BST, graphs (upcoming)
06-advanced/ - Dynamic programming, heaps (future)
07-hard-problems/ - FAANG-level problems (future)
Each solution includes:
- Full problem description
- My solution with comments explaining the approach
- Test cases
Feel free to:
- Learn from the solutions and explanations
- Use as reference while practicing
- Suggest improvements or alternative approaches
All code is commented to prevent conflicts. Uncomment individual solutions to test them.
✅ 18 problems solved in foundations
🔄 Working through core patterns
This tracks my learning path from foundational algorithms to more advanced problems. All solutions are my own work - shared openly for anyone who finds it useful.
MIT License - feel free to use and learn from these solutions.