https://github.com/thecollinsbyte/leetcodej
LeetCode Challanges in Java
https://github.com/thecollinsbyte/leetcodej
gradle java leetcode leetcode-java leetcode-solutions
Last synced: 6 months ago
JSON representation
LeetCode Challanges in Java
- Host: GitHub
- URL: https://github.com/thecollinsbyte/leetcodej
- Owner: TheCollinsByte
- License: mit
- Created: 2024-05-25T09:36:23.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-12-29T10:52:08.000Z (10 months ago)
- Last Synced: 2025-03-29T10:43:46.618Z (7 months ago)
- Topics: gradle, java, leetcode, leetcode-java, leetcode-solutions
- Language: Java
- Homepage:
- Size: 86.9 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
## Description
LeetCodeJ 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.
- [Installation](#installation)
- [Usage](#usage)
- [Solutions](#solutions)
- [Contributing](#contributing)
- [License](#license)
## Installation
Instructions on how to set up the project on a local machine:
1. Clone the repository:
```bash
git clone https://github.com/TheCollinsByte/LeetCodeJ
```
2. Navigate to the project directory:
```bash
cd LeetCodeJ
```
3. Ensure you have JDK version 21 installed. You can download it [here](https://www.oracle.com/java/technologies/downloads/#java21).
4. Compile the project:
```bash
./gradlew build
```
5. Run the project:
```bash
./gradlew :{MODULE_NAME}:test -Dtest.verbose=true
```
## Usage
Each 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.
### Run all test within a module in verbose mode
To run all tests within a module, use the following command:
```shell
./gradlew :array:test -Dtest.verbose=true
```
### Run a specific Test Method in verbose mode
To run a specific test method, use the following command:
```shell
./gradlew :array:test --tests com.collo.TwoSumSolverTest.checkPair -Dtest.verbose=true
```
### Run Tests for All Subprojects in verbose Mode
To run tests for all subprojects in verbose mode:
```shell
./gradlew test -Dtest.verbose=true
```
## Solutions
### Arrays
- [Two Sum](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Can Place Flowers](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Kids With the Greatest Number of Candies](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Move Zeroes](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Increasing Triplet Subsequence](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Product of Array Except Self](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Container With Most Water](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Maximum Average Subarray I](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
- [Max Number of K-Sum Pairs](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
### String
- [Merge Strings Alternately](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [Greatest Common Divisor of Strings](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [Reverse Vowels of a String](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [Reverse Words in a String](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [Is Subsequence](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [Move Zeroes](string/src/main/java/com/thecollinsbyte/leetcode/string/TwoSumSolver.java)
- [String Compression](array/src/main/java/com/thecollinsbyte/leetcode/array/TwoSumSolver.java)
## Contributing
Contributions are Welcome! Please follow these steps:
1. Fork the repository.
2. create a new branch (`git checkout -b name-leetcode-challange-number-branch`)
3. Make your changes and commit them (`git commit -m "Leetcode challange number #1: Solutions"`)
4. Push to the branch (`git push origin name-leetcode-challange-number-branch`).
5. Create a new Pull Request.
## License
This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.
