{"id":29538716,"url":"https://github.com/tareqalkushari/leetcode-problem-solutions","last_synced_at":"2025-08-28T02:49:31.583Z","repository":{"id":304746504,"uuid":"1019813020","full_name":"TareqAlKushari/LeetCode-Problem-Solutions","owner":"TareqAlKushari","description":"This repository contains a comprehensive collection of solutions to LeetCode problems, crafted with clarity and efficiency in mind. Each solution is written in a clean, readable format and includes insights into time and space complexity, making it an ideal resource for technical interview preparation, algorithm practice, and self-paced learning.","archived":false,"fork":false,"pushed_at":"2025-07-15T00:50:43.000Z","size":24,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-07-31T00:37:47.818Z","etag":null,"topics":["algorithm-practice","algorithms","arrays","binary-search","coding-interview","competitive-programming","cpp","data-structures","dynamic-programming","graph-algorithms","hashmap","interview-preparation","java","leetcode","leetcode-solutions","problem-solving","python","recursion","strings","technical-interview"],"latest_commit_sha":null,"homepage":"https://tareqalkushari.github.io/LeetCode-Problem-Solutions/","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/TareqAlKushari.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2025-07-14T23:18:27.000Z","updated_at":"2025-07-15T00:50:46.000Z","dependencies_parsed_at":"2025-07-15T03:48:20.768Z","dependency_job_id":"e8676c9b-30d9-460a-865c-a4f9b1e787b9","html_url":"https://github.com/TareqAlKushari/LeetCode-Problem-Solutions","commit_stats":null,"previous_names":["tareqalkushari/leetcode-problem-solutions"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/TareqAlKushari/LeetCode-Problem-Solutions","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TareqAlKushari%2FLeetCode-Problem-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TareqAlKushari%2FLeetCode-Problem-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TareqAlKushari%2FLeetCode-Problem-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TareqAlKushari%2FLeetCode-Problem-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TareqAlKushari","download_url":"https://codeload.github.com/TareqAlKushari/LeetCode-Problem-Solutions/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TareqAlKushari%2FLeetCode-Problem-Solutions/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272424978,"owners_count":24932896,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-28T02:00:10.768Z","response_time":74,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithm-practice","algorithms","arrays","binary-search","coding-interview","competitive-programming","cpp","data-structures","dynamic-programming","graph-algorithms","hashmap","interview-preparation","java","leetcode","leetcode-solutions","problem-solving","python","recursion","strings","technical-interview"],"created_at":"2025-07-17T05:15:22.894Z","updated_at":"2025-08-28T02:49:31.369Z","avatar_url":"https://github.com/TareqAlKushari.png","language":"Java","readme":"# LeetCode Problem Solutions\n\n## Overview\n\nThis repository contains a collection of solutions to various LeetCode problems implemented in both Java and C++. The solutions cover a range of algorithmic challenges commonly found on LeetCode, including string manipulation, array processing, and classic problem-solving patterns.\n\n## Repository Structure\n\nThe repository is organized by programming language and then further by problem/topic:\n\n```\n├── C++\n│   ├── AddTwoNumbers/\n│   ├── MedianoTwoSortedArrays/\n│   ├── TwoSum/\n│   ├── longestSubstring/\n│   └── README.md\n├── Java/\n│   ├── ConditionalsIf/\n│   ├── StringSolving/\n│   └── README.md\n├── docs/\n│   └── doc.md\n├── translations/\n│   └── README_ar.md\n├── LICENSE\n└── README.md\n```\n\n### Key Solution Folders\n\n- **C++/AddTwoNumbers/**  \n  Solution for the \"Add Two Numbers\" problem using singly-linked lists.\n- **C++/MedianoTwoSortedArrays/**  \n  Solution for finding the median of two sorted arrays.\n- **C++/TwoSum/**  \n  Solution for the classic \"Two Sum\" problem.\n- **C++/longestSubstring/**  \n  Implementation for finding the length of the longest substring without repeating characters.\n- **Java/ConditionalsIf/**  \n  Solutions demonstrating conditional logic, including a Blackjack card game logic.\n- **Java/StringSolving/**  \n  String manipulation problems and log formatting utilities.\n\n## How to Use\n\nBrowse the language-specific folders (`C++` and `Java`) to find implementations of various LeetCode problems. Each problem typically contains a `README.md` and source code files demonstrating one or more approaches.\n\n### Example: Running a Solution in Java\n\nNavigate to the relevant Java folder and execute the main class, for example:\n```bash\ncd Java/StringSolving/src/main/java/com/mycompany/stringsolving\njavac LogLevels.java\njava com.mycompany.stringsolving.LogLevels\n```\n\n### Example: Running a Solution in C++\n\nThe C++ folders may contain Java code for demonstration purposes. Follow the same steps as above, replacing the package paths as needed.\n\n## Documentation \u0026 Translations\n\n- Additional documentation is available in the `docs/` directory.\n- An Arabic translation of the readme is available under `translations/README_ar.md`.\n\n## License\n\nThis repository is licensed under the MIT License. See the [LICENSE](LICENSE) file for details.\n\n## Author\n\nMaintained by [Tareq Al-Kushari](https://github.com/TareqAlKushari).\n\n---\n\nFeel free to explore, use, and contribute to these solutions to improve your algorithmic skills!\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftareqalkushari%2Fleetcode-problem-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftareqalkushari%2Fleetcode-problem-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftareqalkushari%2Fleetcode-problem-solutions/lists"}