Personal collection of LeetCode problem solutions, written primarily in Java, as part of ongoing DSA practice.
This repo tracks my progress solving LeetCode problems as I build toward stronger fundamentals in data structures and algorithms. Each solution includes the problem statement summary, approach/intuition, and time & space complexity.
Each problem folder contains:
Solution.java— the working solution
For each problem, solutions aim to:
- Start with a brute-force approach for correctness
- Optimize toward the ideal time/space complexity
- Document intuition — the "why," not just the "what"
javac Solution.java
java Solution(Add sample input/output or a small test harness per problem if you'd like solutions to be runnable standalone.)
- Cover all core topics (arrays, strings, trees, graphs, DP, greedy, backtracking)
- Consistent complexity analysis for every solution
This project is licensed under the MIT License — feel free to reference or fork for your own practice.