A growing collection of Python solutions to LeetCode problems. This repository is updated regularly as new problems are solved — it's not a fixed set, but an ongoing practice log.
Each solved problem lives in its own folder under solutions/, containing the original question, a clean Python solution, and a short write-up explaining the approach along with its time and space complexity.
solutions/
└── <problem-slug>/
├── question.txt # original problem statement
├── solution.py # Python solution
└── README.md # approach, reasoning, and complexity analysis
Folders are named after the problem (with its LeetCode number where applicable), e.g. 20-valid-parentheses/.
Browse the solutions/ directory for the full, up-to-date list of problems solved so far. New solutions are added as they're completed, so this list is best viewed directly on GitHub rather than duplicated here.
Each solution.py defines a Solution class matching LeetCode's expected format, so it can be:
- pasted directly into the LeetCode editor, or
- run locally by importing the class and instantiating it.
This is primarily a personal practice repository, but suggestions on cleaner approaches or edge cases are always welcome via issues or pull requests.
MIT — see LICENSE.