
DSA & Algorithm Implementations
Implemented stacks, queues, linked lists, trees, and recursion-based algorithms in Java; solved 100+ algorithmic problems with a focus on optimization and complexity analysis.
- Role ·
- Solo
The problem
Wanted a structured, from-scratch understanding of core data structures rather than relying on built-in library implementations — and a disciplined habit of analyzing complexity before optimizing.
The approach
Implemented stacks, queues, linked lists, trees, and recursion-based algorithms from scratch in Java. For each, documented time and space complexity before and after optimization, and solved 100+ problems applying pattern-based problem solving (two pointers, sliding window, DFS/BFS, etc.).
Stack & why
- Java — strict typing and manual collection handling forces a more explicit understanding of what a data structure is actually doing, versus a higher-level language that abstracts it away
Metrics
- 100+ algorithmic problems solved
- Core structures implemented from scratch: stacks, queues, linked lists, trees, recursion
Architecture
A growing library of standalone Java implementations: stacks, queues, linked lists, trees, and recursion patterns. Each implementation is small, tested, and annotated with complexity.
Results
100+ algorithmic problems solved, with implementations spanning stacks, queues, linked lists, trees, and recursion.
What I learned
Optimization is only meaningful after correctness — profile first, optimize second. A fast solution that's wrong is worse than a slow one that's right, because it costs more time to debug later.
