https://github.com/ahmedabougabal/myleetcodeanswers

Documenting my LeetCode solutions in C++ / Python / JavaScript since my time at the ITI till now
https://github.com/ahmedabougabal/myleetcodeanswers

algorithms complexity cpp data-structures dynamic-programming javascript oop problem-solving python

Last synced: 4 days ago
JSON representation

Documenting my LeetCode solutions in C++ / Python / JavaScript since my time at the ITI till now

• Host: GitHub
• URL: https://github.com/ahmedabougabal/myleetcodeanswers
• Owner: ahmedabougabal
• Created: 2024-07-03T05:14:14.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2025-07-05T21:04:49.000Z (9 days ago)
• Last Synced: 2025-07-05T21:37:59.829Z (9 days ago)
• Topics: algorithms, complexity, cpp, data-structures, dynamic-programming, javascript, oop, problem-solving, python
• Language: C++
• Homepage:
• Size: 312 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# myLeetCodeAnswers

![GitHub repo size](https://img.shields.io/github/repo-size/ahmedabougabal/myLeetCodeAnswers)

![GitHub stars](https://img.shields.io/github/stars/ahmedabougabal/myLeetCodeAnswers?style=social)

![GitHub forks](https://img.shields.io/github/forks/ahmedabougabal/myLeetCodeAnswers?style=social)

![GitHub last commit](https://img.shields.io/github/last-commit/ahmedabougabal/myLeetCodeAnswers)

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!

## 📋 Table of Contents

- [About](#about)

- [Solutions](#solutions)

- [Tags](#tags)

- [How to Contribute](#how-to-contribute)

- [Contact](#contact)

## 📝 About

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.

## 💡 Solutions

Here are the some of the current solutions available in the repository:

- **[Find the Minimum and Maximum Number of Nodes Between Critical Points](findtheMinimumAndMaximumNumberOfNodesBetweenCriticalPoints.cpp)** - `took me 5 hrs lol`

- **[Merge Nodes in Between Zeros](mergeNodesInBetweenZeros.cpp)** - `removed unnecessary commented lines`

- **[Group Anagrams](group_anagrams.cpp)** - `[leetcode medium - interview]`

- **[Reverse Substrings Between Each Pair of Parentheses](ReverseSubstringsBetweenEachPairofParentheses.cpp)** - `final update`

- **[Pass the Pillow](PassThePillow.cpp)** - `pillow pushed`

- **[Average Waiting Time](averageWaitingTime.cpp)** - `clients are hungry :)`

- **[Find the Winner of the Circular Game](FindtheWinneroftheCircularGame.cpp)** - `missed '+1' in the return`

## 🔖 Tags

Some common tags used in this repository include:

![algorithms](https://img.shields.io/badge/-algorithms-blue)

![cpp](https://img.shields.io/badge/-cpp-blue)

![oop](https://img.shields.io/badge/-oop-blue)

![data-structures](https://img.shields.io/badge/-data--structures-blue)

![complexity](https://img.shields.io/badge/-complexity-blue)

![problem-solving](https://img.shields.io/badge/-problem--solving-blue)

![javascript](https://img.shields.io/badge/-javascript-blue)

## 🤝 How to Contribute

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!

1. Fork the repository.

2. Create your feature branch (`git checkout -b AddingGreatStuff`).

3. Commit your changes (`git commit -m 'betterComplexity'`).

4. Push to the branch (`git push origin AddingGreatStuff`).

5. Open a pull request.

## 📞 Contact

If you have any questions or suggestions, feel free to reach out. You can contact me through [GitHub](https://github.com/ahmedabougabal).

---

⭐️ Don't forget to give the project a star if you found it useful!