{"id":22668682,"url":"https://github.com/thecollinsbyte/leetcodej","last_synced_at":"2026-02-05T13:32:23.750Z","repository":{"id":242140583,"uuid":"805725202","full_name":"TheCollinsByte/LeetCodeJ","owner":"TheCollinsByte","description":"LeetCode Challanges in Java","archived":false,"fork":false,"pushed_at":"2024-12-29T10:52:08.000Z","size":89,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-19T19:27:05.400Z","etag":null,"topics":["gradle","java","leetcode","leetcode-java","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","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/TheCollinsByte.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}},"created_at":"2024-05-25T09:36:23.000Z","updated_at":"2025-01-06T09:00:09.000Z","dependencies_parsed_at":"2024-06-16T20:15:09.437Z","dependency_job_id":"e10eef8a-6ddc-44b8-bbd4-a7aa50daad8c","html_url":"https://github.com/TheCollinsByte/LeetCodeJ","commit_stats":null,"previous_names":["theoddagen/leetcodej","collinsbyte/leetcodej","thecollinsbyte/leetcodej"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/TheCollinsByte/LeetCodeJ","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheCollinsByte%2FLeetCodeJ","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheCollinsByte%2FLeetCodeJ/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheCollinsByte%2FLeetCodeJ/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheCollinsByte%2FLeetCodeJ/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TheCollinsByte","download_url":"https://codeload.github.com/TheCollinsByte/LeetCodeJ/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheCollinsByte%2FLeetCodeJ/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29122612,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-05T10:47:47.471Z","status":"ssl_error","status_checked_at":"2026-02-05T10:45:08.119Z","response_time":65,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5: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":["gradle","java","leetcode","leetcode-java","leetcode-solutions"],"created_at":"2024-12-09T15:16:18.991Z","updated_at":"2026-02-05T13:32:23.724Z","avatar_url":"https://github.com/TheCollinsByte.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n\n\u003ch1\u003e\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ\"\u003eLeetCodeJ\u003c/a\u003e\u003c/h1\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/blob/main/LICENSE\"\u003e\n\u003cimg alt=\"License\" src=\"https://img.shields.io/github/license/TheCollinsByte/LeetCodeJ?style=flat\u0026color=eee\u0026label=\"\u003e \u003c/a\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/graphs/contributors\"\u003e\n\u003cimg alt=\"People\" src=\"https://img.shields.io/github/contributors/TheCollinsByte/LeetCodeJ?style=flat\u0026color=ffaaf2\u0026label=People\"\u003e \u003c/a\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/stargazers\"\u003e\n\u003cimg alt=\"Stars\" src=\"https://img.shields.io/github/stars/TheCollinsByte/LeetCodeJ?style=flat\u0026color=98c379\u0026label=Stars\"\u003e \u003c/a\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/network/members\"\u003e\n\u003cimg alt=\"Forks\" src=\"https://img.shields.io/github/forks/TheCollinsByte/LeetCodeJ?style=flat\u0026color=66a8e0\u0026label=Forks\"\u003e \u003c/a\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/watchers\"\u003e\n\u003cimg alt=\"Watches\" src=\"https://img.shields.io/github/watchers/TheCollinsByte/LeetCodeJ?style=flat\u0026color=f5d08b\u0026label=Watches\"\u003e \u003c/a\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ/pulse\"\u003e\n\u003cimg alt=\"Last Updated\" src=\"https://img.shields.io/github/last-commit/TheCollinsByte/LeetCodeJ?style=flat\u0026color=e06c75\u0026label=\"\u003e \u003c/a\u003e\n\n\u003c/div\u003e\n\n## Description\n\nLeetCodeJ is an open-source project where I solve LeetCode challenges using Java. The aim is to provide efficient and well-documented solutions to a variety of coding problems.\n\n- [Installation](#installation)\n- [Usage](#usage)\n- [Solutions](#solutions)\n- [Contributing](#contributing)\n- [License](#license)\n\n## Installation\n\nInstructions on how to set up the project on a local machine:\n\n1. Clone the repository:\n    ```bash\n    git clone https://github.com/TheCollinsByte/LeetCodeJ\n    ```\n2. Navigate to the project directory:\n    ```bash\n    cd LeetCodeJ\n    ```\n3. Ensure you have JDK version 21 installed. You can download it [here](https://www.oracle.com/java/technologies/downloads/#java21).\n\n4. Compile the project:\n    ```bash\n   ./gradlew build\n    ```\n5. Run the project:\n    ```bash\n    ./gradlew :{MODULE_NAME}:test -Dtest.verbose=true\n    ```\n   \n## Usage\n\nEach solution is a separate subproject within the Gradle multi-project setup, organized by specific challenge topics. To verify the solutions, you can run tests for specific subprojects, all tests within a module and all test for all Sub-Projects in verbose mode.\n\n### Run all test within a module in verbose mode\n\nTo run all tests within a module, use the following command:\n\n```shell\n./gradlew :array:test -Dtest.verbose=true\n```\n\n### Run a specific Test Method in verbose mode\n\nTo run a specific test method, use the following command:\n\n```shell\n./gradlew :array:test --tests com.collo.TwoSumSolverTest.checkPair -Dtest.verbose=true\n```\n\n### Run Tests for All Subprojects in verbose Mode\n\nTo run tests for all subprojects in verbose mode:\n\n```shell\n./gradlew test -Dtest.verbose=true\n```\n\n## Solutions\n\n### Arrays\n- [Two Sum](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Can Place Flowers](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Kids With the Greatest Number of Candies](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Move Zeroes](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Increasing Triplet Subsequence](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Product of Array Except Self](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Container With Most Water](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Maximum Average Subarray I](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n- [Max Number of K-Sum Pairs](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n\n### String\n- [Merge Strings Alternately](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [Greatest Common Divisor of Strings](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [Reverse Vowels of a String](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [Reverse Words in a String](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [Is Subsequence](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [Move Zeroes](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)\n- [String Compression](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)\n\n## Contributing\n\nContributions are Welcome! Please follow these steps:\n\n1. Fork the repository.\n2. create a new branch (`git checkout -b name-leetcode-challange-number-branch`)\n3. Make your changes and commit them (`git commit -m \"Leetcode challange number #1: Solutions\"`)\n4. Push to the branch (`git push origin name-leetcode-challange-number-branch`).\n5. Create a new Pull Request.\n\n## License\n\nThis project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.\n\n\u003cbr/\u003e\u003cbr/\u003e\n\n\u003cdiv align=\"center\"\u003e\n\n\u003cstrong\u003e⭐ hit the star button if you found this useful ⭐\u003c/strong\u003e\u003cbr\u003e\n\n\u003ca href=\"https://github.com/TheCollinsByte/LeetCodeJ\"\u003eSource\u003c/a\u003e\n| \u003ca href=\"https://x.com/TheCollinsByte\" target=\"_blank\"\u003eTwitter \u003c/a\u003e\n| \u003ca href=\"http://www.linkedin.com/in/collins-boniface\" target=\"_blank\"\u003eLinkedIn \u003c/a\u003e\n| \u003ca href=\"mailto:collo@fastmail.com\"\u003eEmail\u003c/a\u003e\n\u003c/div\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthecollinsbyte%2Fleetcodej","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthecollinsbyte%2Fleetcodej","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthecollinsbyte%2Fleetcodej/lists"}