{"id":21239567,"url":"https://github.com/ahmedabougabal/myleetcodeanswers","last_synced_at":"2026-03-05T01:03:06.831Z","repository":{"id":247018075,"uuid":"823467594","full_name":"ahmedabougabal/myLeetCodeAnswers","owner":"ahmedabougabal","description":"Documenting my LeetCode solutions in  C++ / Python / JavaScript since my time at the ITI till now","archived":false,"fork":false,"pushed_at":"2025-12-27T17:53:02.000Z","size":351,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-29T16:13:59.706Z","etag":null,"topics":["algorithms","complexity","cpp","data-structures","dynamic-programming","javascript","oop","problem-solving","python"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ahmedabougabal.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-07-03T05:14:14.000Z","updated_at":"2025-12-27T17:53:05.000Z","dependencies_parsed_at":"2024-07-26T09:28:28.917Z","dependency_job_id":"363a5035-313a-4d77-a10d-d338e281a1bf","html_url":"https://github.com/ahmedabougabal/myLeetCodeAnswers","commit_stats":null,"previous_names":["ahmedabougabal/myleetcodeanswers"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ahmedabougabal/myLeetCodeAnswers","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmedabougabal%2FmyLeetCodeAnswers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmedabougabal%2FmyLeetCodeAnswers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmedabougabal%2FmyLeetCodeAnswers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmedabougabal%2FmyLeetCodeAnswers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ahmedabougabal","download_url":"https://codeload.github.com/ahmedabougabal/myLeetCodeAnswers/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ahmedabougabal%2FmyLeetCodeAnswers/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30104218,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-05T00:38:46.881Z","status":"ssl_error","status_checked_at":"2026-03-05T00:38:45.829Z","response_time":59,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","complexity","cpp","data-structures","dynamic-programming","javascript","oop","problem-solving","python"],"created_at":"2024-11-21T00:44:09.508Z","updated_at":"2026-03-05T01:03:01.758Z","avatar_url":"https://github.com/ahmedabougabal.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# myLeetCodeAnswers\n\n![GitHub repo size](https://img.shields.io/github/repo-size/ahmedabougabal/myLeetCodeAnswers)\n![GitHub stars](https://img.shields.io/github/stars/ahmedabougabal/myLeetCodeAnswers?style=social)\n![GitHub forks](https://img.shields.io/github/forks/ahmedabougabal/myLeetCodeAnswers?style=social)\n![GitHub last commit](https://img.shields.io/github/last-commit/ahmedabougabal/myLeetCodeAnswers)\n\nWelcome 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!\n\n## 📋 Table of Contents\n\n- [About](#about)\n- [Solutions](#solutions)\n- [Tags](#tags)\n- [How to Contribute](#how-to-contribute)\n- [Contact](#contact)\n\n## 📝 About\n\nThis 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.\n\n## 💡 Solutions\n\nHere are the some of the current solutions available in the repository:\n\n- **[Find the Minimum and Maximum Number of Nodes Between Critical Points](findtheMinimumAndMaximumNumberOfNodesBetweenCriticalPoints.cpp)** - `took me 5 hrs lol`\n- **[Merge Nodes in Between Zeros](mergeNodesInBetweenZeros.cpp)** - `removed unnecessary commented lines`\n- **[Group Anagrams](group_anagrams.cpp)** - `[leetcode medium - interview]`\n- **[Reverse Substrings Between Each Pair of Parentheses](ReverseSubstringsBetweenEachPairofParentheses.cpp)** - `final update`\n- **[Pass the Pillow](PassThePillow.cpp)** - `pillow pushed`\n- **[Average Waiting Time](averageWaitingTime.cpp)** - `clients are hungry :)`\n- **[Find the Winner of the Circular Game](FindtheWinneroftheCircularGame.cpp)** - `missed '+1' in the return`\n\n## 🔖 Tags\n\nSome common tags used in this repository include:\n\n![algorithms](https://img.shields.io/badge/-algorithms-blue)\n![cpp](https://img.shields.io/badge/-cpp-blue)\n![oop](https://img.shields.io/badge/-oop-blue)\n![data-structures](https://img.shields.io/badge/-data--structures-blue)\n![complexity](https://img.shields.io/badge/-complexity-blue)\n![problem-solving](https://img.shields.io/badge/-problem--solving-blue)\n![javascript](https://img.shields.io/badge/-javascript-blue)\n\n## 🤝 How to Contribute\n\nIf 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!\n\n1. Fork the repository.\n2. Create your feature branch (`git checkout -b AddingGreatStuff`).\n3. Commit your changes (`git commit -m 'betterComplexity'`).\n4. Push to the branch (`git push origin AddingGreatStuff`).\n5. Open a pull request.\n\n## 📞 Contact\n\nIf you have any questions or suggestions, feel free to reach out. You can contact me through [GitHub](https://github.com/ahmedabougabal).\n\n---\n\n⭐️ Don't forget to give the project a star if you found it useful!\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahmedabougabal%2Fmyleetcodeanswers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fahmedabougabal%2Fmyleetcodeanswers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fahmedabougabal%2Fmyleetcodeanswers/lists"}