This repository serves as a collection of my solutions to various LeetCode problems. Each problem solution is stored as a separate commit, making it easy to track changes and revise the solutions over time. This approach allows me to maintain a version history of my solutions and improvements.
- Each language has a dedicated directory for storing the solutions of problems
- Each LeetCode problem has its own directory named by its problem description
(e.g.,
twoSum). - Inside each directory, you can find the solution file(s) along with any necessary resources or explanations.
- Solutions are committed each with a clear commit message indicating its difficulty level and the approach for both the general and optimal solutions