Welcome to the myLeetCodeAnswers repository! Here, I share my solutions to various LeetCode problems to assist others in their coding journey. Feel free to explore, learn, and contribute!
This repository contains my problem-solving solutions for various LeetCode challenges. Each solution is written in C++ and aims to provide a clear and efficient approach to solving the given problem. I hope these solutions help you in understanding different algorithms and data structures.
Here are the some of the current solutions available in the repository:
- Find the Minimum and Maximum Number of Nodes Between Critical Points -
took me 5 hrs lol - Merge Nodes in Between Zeros -
removed unnecessary commented lines - Group Anagrams -
[leetcode medium - interview] - Reverse Substrings Between Each Pair of Parentheses -
final update - Pass the Pillow -
pillow pushed - Average Waiting Time -
clients are hungry :) - Find the Winner of the Circular Game -
missed '+1' in the return
Some common tags used in this repository include:
If you have a better solution or want to add new solutions, feel free to fork this repository, make your changes, and create a pull request. Any contributions are welcome!
- Fork the repository.
- Create your feature branch (
git checkout -b AddingGreatStuff). - Commit your changes (
git commit -m 'betterComplexity'). - Push to the branch (
git push origin AddingGreatStuff). - Open a pull request.
If you have any questions or suggestions, feel free to reach out. You can contact me through GitHub.
⭐️ Don't forget to give the project a star if you found it useful!