• This repo is a curated list of problems that I consider important for tech interviews.
• Not complete, I am still working on adding some problems and this repo will regularly be maintained.
• All solutions are not necessarily optimal, but my means of identifying the most intuitive approach for a particular problem.

• The problems selected are primarily weighted toward NeetCode 150 and Striver's A2Z DSA Sheet.

Found a more optimal solution or a bug? Contributions are welcome.

# Fork and clone
git clone https://github.com/Aruisop/LC

# Create a feature branch
git checkout -b fix/42-trapping-rain-water

# Commit your changes
git commit -m "Optimize solution using two-pointer O(1) space"

# Open a Pull Request

Please keep solutions in Java or Go and include a brief comment explaining the time and space complexity.

⭐ If this repo helped you in any way possible, make sure to give it a star :) ⭐