Java

Java copied to clipboard

feat: Add TokenBucket new algorithm with Junit tests

1

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Hardvan

feat: Add `MergeKSortedArrays` new algorithm with Junit tests

1

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Hardvan

feat: Add `SlidingWindowMaximum` new algorithm with Junit tests

1

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Hardvan

feat: Add MedianFinder new algorithm with Junit tests

1

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Hardvan

feat: Add KthElementFinder new algorithm with Junit tests

1

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Hardvan

Create Unrolled Linked List

1

A linked list variant that stores multiple elements in each node to improve cache performance. - [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own...

vishantrathi

Similar to a doubly linked list but with the last node pointing back to the first node - [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all...

vishantrathi

Longest Common Prefix

1

Here is the Approach : 1)Sort the Array: Sort the array of strings to bring strings with common prefixes adjacent to each other. 2)Identify Extremes: Select the first and last...

mrinalchauhan

Feature 3: Add-on of KMeansClustering Algorithm in backtracking folder

2

- [X] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [X] This pull request is all my own work -- I have not plagiarized it. - [X] All filenames are in PascalCase. -...

Jivan052

- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...

Fenirok