primeFactors = new ArrayList<>();
diff --git a/src/main/java/com/thealgorithms/maths/PronicNumber.java b/src/main/java/com/thealgorithms/maths/PronicNumber.java
index 312af21ea..1ae53c4c4 100644
--- a/src/main/java/com/thealgorithms/maths/PronicNumber.java
+++ b/src/main/java/com/thealgorithms/maths/PronicNumber.java
@@ -10,7 +10,9 @@ package com.thealgorithms.maths;
*
* */
-public class PronicNumber {
+public final class PronicNumber {
+ private PronicNumber() {
+ }
/**
* This method checks if the given number is pronic number or non-pronic number
diff --git a/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java b/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java
index 68932c0b7..f535e9e69 100644
--- a/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java
+++ b/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java
@@ -3,7 +3,9 @@ package com.thealgorithms.maths;
/**
* https://en.wikipedia.org/wiki/Pythagorean_triple
*/
-public class PythagoreanTriple {
+public final class PythagoreanTriple {
+ private PythagoreanTriple() {
+ }
public static void main(String[] args) {
assert isPythagTriple(3, 4, 5);
diff --git a/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java b/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java
index 0caa28623..8f5d44dbe 100644
--- a/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java
+++ b/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java
@@ -8,7 +8,9 @@ package com.thealgorithms.maths;
* @author Sokratis Fotkatzikis
* @version 1.0
*/
-public class RomanNumeralUtil {
+public final class RomanNumeralUtil {
+ private RomanNumeralUtil() {
+ }
private static final int MIN_VALUE = 1;
private static final int MAX_VALUE = 5999;
diff --git a/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java b/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java
index c988bb708..22e9fee00 100644
--- a/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java
+++ b/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java
@@ -14,7 +14,9 @@ package com.thealgorithms.maths;
import java.util.HashSet;
import java.util.List;
-public class SquareFreeInteger {
+public final class SquareFreeInteger {
+ private SquareFreeInteger() {
+ }
/**
* This method returns whether an integer is square free
*
diff --git a/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java b/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java
index 2f8fa9a83..90af556f8 100644
--- a/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java
+++ b/src/main/java/com/thealgorithms/maths/SquareRootWithBabylonianMethod.java
@@ -1,6 +1,8 @@
package com.thealgorithms.maths;
-public class SquareRootWithBabylonianMethod {
+public final class SquareRootWithBabylonianMethod {
+ private SquareRootWithBabylonianMethod() {
+ }
/**
* get the value, return the square root
diff --git a/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java b/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java
index eb116d21a..80d185c93 100644
--- a/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java
+++ b/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java
@@ -14,7 +14,9 @@ package com.thealgorithms.maths;
* be changed according to the user preference.
*/
-public class SquareRootWithNewtonRaphsonMethod {
+public final class SquareRootWithNewtonRaphsonMethod {
+ private SquareRootWithNewtonRaphsonMethod() {
+ }
public static double squareRoot(int n) {
double x = n; // initially taking a guess that x = n.
diff --git a/src/main/java/com/thealgorithms/maths/StandardDeviation.java b/src/main/java/com/thealgorithms/maths/StandardDeviation.java
index 84d21f308..29ff070e9 100644
--- a/src/main/java/com/thealgorithms/maths/StandardDeviation.java
+++ b/src/main/java/com/thealgorithms/maths/StandardDeviation.java
@@ -1,6 +1,8 @@
package com.thealgorithms.maths;
-public class StandardDeviation {
+public final class StandardDeviation {
+ private StandardDeviation() {
+ }
public static double stdDev(double[] data) {
double var = 0;
diff --git a/src/main/java/com/thealgorithms/maths/StandardScore.java b/src/main/java/com/thealgorithms/maths/StandardScore.java
index dcedf458b..22a9f550e 100644
--- a/src/main/java/com/thealgorithms/maths/StandardScore.java
+++ b/src/main/java/com/thealgorithms/maths/StandardScore.java
@@ -1,6 +1,8 @@
package com.thealgorithms.maths;
-public class StandardScore {
+public final class StandardScore {
+ private StandardScore() {
+ }
public static double zScore(double num, double mean, double stdDev) {
return (num - mean) / stdDev;
diff --git a/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java b/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java
index 0e2fe9e7a..c2a173000 100644
--- a/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java
+++ b/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java
@@ -7,7 +7,9 @@ package com.thealgorithms.maths;
*
* Example Input: n = 4 Output 1 1 1 1 1 2 3 2 1 1 3 6 7 6 3 1
*/
-public class TrinomialTriangle {
+public final class TrinomialTriangle {
+ private TrinomialTriangle() {
+ }
public static int TrinomialValue(int n, int k) {
if (n == 0 && k == 0) {
diff --git a/src/main/java/com/thealgorithms/maths/TwinPrime.java b/src/main/java/com/thealgorithms/maths/TwinPrime.java
index 867a1d23f..81731376b 100644
--- a/src/main/java/com/thealgorithms/maths/TwinPrime.java
+++ b/src/main/java/com/thealgorithms/maths/TwinPrime.java
@@ -9,7 +9,9 @@ package com.thealgorithms.maths;
*
* */
-public class TwinPrime {
+public final class TwinPrime {
+ private TwinPrime() {
+ }
/**
* This method returns twin prime of the integer value passed as argument
diff --git a/src/main/java/com/thealgorithms/maths/VampireNumber.java b/src/main/java/com/thealgorithms/maths/VampireNumber.java
index d9aa4f203..d64c82c6e 100644
--- a/src/main/java/com/thealgorithms/maths/VampireNumber.java
+++ b/src/main/java/com/thealgorithms/maths/VampireNumber.java
@@ -16,7 +16,9 @@ import java.util.Collections;
*
*
*/
-public class VampireNumber {
+public final class VampireNumber {
+ private VampireNumber() {
+ }
public static void main(String[] args) {
test(10, 1000);
diff --git a/src/main/java/com/thealgorithms/maths/Volume.java b/src/main/java/com/thealgorithms/maths/Volume.java
index edc3575df..4b73f849b 100644
--- a/src/main/java/com/thealgorithms/maths/Volume.java
+++ b/src/main/java/com/thealgorithms/maths/Volume.java
@@ -1,7 +1,9 @@
package com.thealgorithms.maths;
/* Calculate the volume of various shapes.*/
-public class Volume {
+public final class Volume {
+ private Volume() {
+ }
/**
* Calculate the volume of a cube.
diff --git a/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java b/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java
index b2e4576b6..afd349330 100644
--- a/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java
+++ b/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java
@@ -7,7 +7,9 @@ import java.util.Scanner;
* see https://www.geeksforgeeks.org/matrix-exponentiation/
*
*/
-public class Fibonacci {
+public final class Fibonacci {
+ private Fibonacci() {
+ }
// Exponentiation matrix for Fibonacci sequence
private static final int[][] FIB_MATRIX = {{1, 1}, {1, 0}};
diff --git a/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java b/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java
index 0fb5b6f17..5543463e9 100644
--- a/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java
+++ b/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java
@@ -11,7 +11,9 @@ import java.util.Scanner;
*
* We can also find the inverse of a matrix
*/
-public class InverseOfMatrix {
+public final class InverseOfMatrix {
+ private InverseOfMatrix() {
+ }
public static void main(String[] argv) {
Scanner input = new Scanner(System.in);
diff --git a/src/main/java/com/thealgorithms/misc/MapReduce.java b/src/main/java/com/thealgorithms/misc/MapReduce.java
index baf960f8e..c07695734 100644
--- a/src/main/java/com/thealgorithms/misc/MapReduce.java
+++ b/src/main/java/com/thealgorithms/misc/MapReduce.java
@@ -15,7 +15,9 @@ and the Reduce step, where the results from the Map step are combined to produce
* Wikipedia link : https://en.wikipedia.org/wiki/MapReduce
*/
-public class MapReduce {
+public final class MapReduce {
+ private MapReduce() {
+ }
/*
*Counting all the words frequency within a sentence.
*/
diff --git a/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java b/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java
index 4d8b980f2..d4ddffe8d 100644
--- a/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java
+++ b/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java
@@ -10,6 +10,8 @@ import java.util.List;
*/
public final class MedianOfMatrix {
+ private MedianOfMatrix() {
+ }
public static int median(List> matrix) {
// Flatten the matrix into a 1D list
diff --git a/src/main/java/com/thealgorithms/misc/PalindromePrime.java b/src/main/java/com/thealgorithms/misc/PalindromePrime.java
index 58de93839..6b01cdced 100644
--- a/src/main/java/com/thealgorithms/misc/PalindromePrime.java
+++ b/src/main/java/com/thealgorithms/misc/PalindromePrime.java
@@ -2,7 +2,9 @@ package com.thealgorithms.misc;
import java.util.Scanner;
-public class PalindromePrime {
+public final class PalindromePrime {
+ private PalindromePrime() {
+ }
public static void main(String[] args) { // Main funtion
Scanner in = new Scanner(System.in);
diff --git a/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java b/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
index f70a443e9..0dfc8ac32 100644
--- a/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
+++ b/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java
@@ -2,7 +2,9 @@ package com.thealgorithms.misc;
import java.util.Arrays;
-public class RangeInSortedArray {
+public final class RangeInSortedArray {
+ private RangeInSortedArray() {
+ }
public static void main(String[] args) {
// Testcases
diff --git a/src/main/java/com/thealgorithms/misc/Sort012D.java b/src/main/java/com/thealgorithms/misc/Sort012D.java
index a311dac44..b51664ce7 100644
--- a/src/main/java/com/thealgorithms/misc/Sort012D.java
+++ b/src/main/java/com/thealgorithms/misc/Sort012D.java
@@ -11,7 +11,9 @@ import java.util.Scanner;
* For more information on the Dutch national flag algorithm refer
* https://en.wikipedia.org/wiki/Dutch_national_flag_problem
*/
-public class Sort012D {
+public final class Sort012D {
+ private Sort012D() {
+ }
public static void main(String[] args) {
Scanner np = new Scanner(System.in);
diff --git a/src/main/java/com/thealgorithms/misc/Sparcity.java b/src/main/java/com/thealgorithms/misc/Sparsity.java
similarity index 82%
rename from src/main/java/com/thealgorithms/misc/Sparcity.java
rename to src/main/java/com/thealgorithms/misc/Sparsity.java
index 10b6f5809..cae2fbdea 100644
--- a/src/main/java/com/thealgorithms/misc/Sparcity.java
+++ b/src/main/java/com/thealgorithms/misc/Sparsity.java
@@ -11,15 +11,17 @@ import java.util.Scanner;
* @author Ojasva Jain
*/
-class Sparcity {
+final class Sparsity {
+ private Sparsity() {
+ }
/*
- * @return Sparcity of matrix
+ * @return Sparsity of matrix
*
- * where sparcity = number of zeroes/total elements in matrix
+ * where sparsity = number of zeroes/total elements in matrix
*
*/
- static double sparcity(double[][] mat) {
+ static double sparsity(double[][] mat) {
int zero = 0;
// Traversing the matrix to count number of zeroes
for (int i = 0; i < mat.length; i++) {
@@ -29,7 +31,7 @@ class Sparcity {
}
}
}
- // return sparcity
+ // return sparsity
return ((double) zero / (mat.length * mat[1].length));
}
@@ -48,7 +50,7 @@ class Sparcity {
mat[i][j] = in.nextDouble();
}
}
- System.out.println("Sparcity of matrix is: " + sparcity(mat));
+ System.out.println("Sparsity of matrix is: " + sparsity(mat));
in.close();
}
}
diff --git a/src/main/java/com/thealgorithms/misc/WordBoggle.java b/src/main/java/com/thealgorithms/misc/WordBoggle.java
index b56b907de..3eb0dc95f 100644
--- a/src/main/java/com/thealgorithms/misc/WordBoggle.java
+++ b/src/main/java/com/thealgorithms/misc/WordBoggle.java
@@ -8,7 +8,9 @@ import java.util.List;
import java.util.Map;
import java.util.Set;
-public class WordBoggle {
+public final class WordBoggle {
+ private WordBoggle() {
+ }
/**
* O(nm * 8^s + ws) time where n = width of boggle board, m = height of
diff --git a/src/main/java/com/thealgorithms/misc/matrixTranspose.java b/src/main/java/com/thealgorithms/misc/matrixTranspose.java
index b5ad02184..bf81675af 100644
--- a/src/main/java/com/thealgorithms/misc/matrixTranspose.java
+++ b/src/main/java/com/thealgorithms/misc/matrixTranspose.java
@@ -18,7 +18,9 @@ import java.util.Scanner;
* @version 11.0.9
* @since 2014-03-31
*/
-public class matrixTranspose {
+public final class matrixTranspose {
+ private matrixTranspose() {
+ }
public static void main(String[] args) {
/*
diff --git a/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java b/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java
index 4ee54bbda..f43841f1f 100644
--- a/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java
+++ b/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java
@@ -8,7 +8,9 @@ package com.thealgorithms.others;
* @author sangin-lee
*/
-public class ArrayLeftRotation {
+public final class ArrayLeftRotation {
+ private ArrayLeftRotation() {
+ }
/*
* Returns the result of left rotation of given array arr and integer n
diff --git a/src/main/java/com/thealgorithms/others/BFPRT.java b/src/main/java/com/thealgorithms/others/BFPRT.java
index 29f47cd68..9e6fe6a3f 100644
--- a/src/main/java/com/thealgorithms/others/BFPRT.java
+++ b/src/main/java/com/thealgorithms/others/BFPRT.java
@@ -5,7 +5,9 @@ import java.util.Arrays;
/**
* BFPRT algorithm.
*/
-public class BFPRT {
+public final class BFPRT {
+ private BFPRT() {
+ }
public static int[] getMinKNumsByBFPRT(int[] arr, int k) {
if (k < 1 || k > arr.length) {
diff --git a/src/main/java/com/thealgorithms/others/BankersAlgorithm.java b/src/main/java/com/thealgorithms/others/BankersAlgorithm.java
index 3fbb4f9fd..fb699d89c 100644
--- a/src/main/java/com/thealgorithms/others/BankersAlgorithm.java
+++ b/src/main/java/com/thealgorithms/others/BankersAlgorithm.java
@@ -20,7 +20,9 @@ package com.thealgorithms.others;
*/
import java.util.Scanner;
-public class BankersAlgorithm {
+public final class BankersAlgorithm {
+ private BankersAlgorithm() {
+ }
/**
* This method finds the need of each process
diff --git a/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java b/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java
index a1983fecc..b70fffe82 100644
--- a/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java
+++ b/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java
@@ -20,7 +20,9 @@ import java.util.Scanner;
*
* Time Complexity: O(logn)
*/
-public class BrianKernighanAlgorithm {
+public final class BrianKernighanAlgorithm {
+ private BrianKernighanAlgorithm() {
+ }
/**
* @param num: number in which we count the set bits
diff --git a/src/main/java/com/thealgorithms/others/CRC16.java b/src/main/java/com/thealgorithms/others/CRC16.java
index c5c3b1f35..85e5cd2c1 100644
--- a/src/main/java/com/thealgorithms/others/CRC16.java
+++ b/src/main/java/com/thealgorithms/others/CRC16.java
@@ -3,7 +3,9 @@ package com.thealgorithms.others;
/**
* Generates a crc16 checksum for a given string
*/
-public class CRC16 {
+public final class CRC16 {
+ private CRC16() {
+ }
public static void main(String[] args) {
System.out.println(crc16("Hello World!"));
diff --git a/src/main/java/com/thealgorithms/others/CRC32.java b/src/main/java/com/thealgorithms/others/CRC32.java
index 561a33f4d..180936ed4 100644
--- a/src/main/java/com/thealgorithms/others/CRC32.java
+++ b/src/main/java/com/thealgorithms/others/CRC32.java
@@ -5,7 +5,9 @@ import java.util.BitSet;
/**
* Generates a crc32 checksum for a given string or byte array
*/
-public class CRC32 {
+public final class CRC32 {
+ private CRC32() {
+ }
public static void main(String[] args) {
System.out.println(Integer.toHexString(crc32("Hello World")));
diff --git a/src/main/java/com/thealgorithms/others/Conway.java b/src/main/java/com/thealgorithms/others/Conway.java
index 4ae4d7418..ab39890c9 100644
--- a/src/main/java/com/thealgorithms/others/Conway.java
+++ b/src/main/java/com/thealgorithms/others/Conway.java
@@ -4,7 +4,9 @@ import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
-public class Conway {
+public final class Conway {
+ private Conway() {
+ }
/*
* This class will generate the conway sequence also known as the look and say sequence.
diff --git a/src/main/java/com/thealgorithms/others/CountChar.java b/src/main/java/com/thealgorithms/others/CountChar.java
index 5a78c0c17..99441b839 100644
--- a/src/main/java/com/thealgorithms/others/CountChar.java
+++ b/src/main/java/com/thealgorithms/others/CountChar.java
@@ -1,6 +1,8 @@
package com.thealgorithms.others;
-public class CountChar {
+public final class CountChar {
+ private CountChar() {
+ }
/**
* Count non space character in string
diff --git a/src/main/java/com/thealgorithms/others/Damm.java b/src/main/java/com/thealgorithms/others/Damm.java
index a32ae246a..55a4c5b81 100644
--- a/src/main/java/com/thealgorithms/others/Damm.java
+++ b/src/main/java/com/thealgorithms/others/Damm.java
@@ -14,7 +14,9 @@ import java.util.Objects;
* @see Wiki. Damm
* algorithm
*/
-public class Damm {
+public final class Damm {
+ private Damm() {
+ }
/**
* Weakly totally anti-symmetric quasigroup of order 10. This table is not
diff --git a/src/main/java/com/thealgorithms/others/Dijkstra.java b/src/main/java/com/thealgorithms/others/Dijkstra.java
index 172e151f7..56fc32a96 100644
--- a/src/main/java/com/thealgorithms/others/Dijkstra.java
+++ b/src/main/java/com/thealgorithms/others/Dijkstra.java
@@ -20,7 +20,9 @@ import java.util.Map;
import java.util.NavigableSet;
import java.util.TreeSet;
-public class Dijkstra {
+public final class Dijkstra {
+ private Dijkstra() {
+ }
private static final Graph.Edge[] GRAPH = {
// Distance from node "a" to node "b" is 7.
diff --git a/src/main/java/com/thealgorithms/others/FibbonaciSeries.java b/src/main/java/com/thealgorithms/others/FibbonaciSeries.java
index 103e94374..bb1500e5c 100644
--- a/src/main/java/com/thealgorithms/others/FibbonaciSeries.java
+++ b/src/main/java/com/thealgorithms/others/FibbonaciSeries.java
@@ -15,7 +15,9 @@ import java.util.Scanner;
* Problem Statement: print all Fibonacci numbers that are smaller than your
* given input N
*/
-public class FibbonaciSeries {
+public final class FibbonaciSeries {
+ private FibbonaciSeries() {
+ }
public static void main(String[] args) {
// Get input from the user
diff --git a/src/main/java/com/thealgorithms/others/FloydTriangle.java b/src/main/java/com/thealgorithms/others/FloydTriangle.java
index d25ab303e..9e8879838 100644
--- a/src/main/java/com/thealgorithms/others/FloydTriangle.java
+++ b/src/main/java/com/thealgorithms/others/FloydTriangle.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-class FloydTriangle {
+final class FloydTriangle {
+ private FloydTriangle() {
+ }
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
diff --git a/src/main/java/com/thealgorithms/others/GuassLegendre.java b/src/main/java/com/thealgorithms/others/GuassLegendre.java
index 8b15739a6..5d2d585d1 100644
--- a/src/main/java/com/thealgorithms/others/GuassLegendre.java
+++ b/src/main/java/com/thealgorithms/others/GuassLegendre.java
@@ -6,7 +6,9 @@ package com.thealgorithms.others;
*
* @author AKS1996
*/
-public class GuassLegendre {
+public final class GuassLegendre {
+ private GuassLegendre() {
+ }
public static void main(String[] args) {
for (int i = 1; i <= 3; ++i) {
diff --git a/src/main/java/com/thealgorithms/others/HappyNumbersSeq.java b/src/main/java/com/thealgorithms/others/HappyNumbersSeq.java
index 57ff204c3..0ae1e451b 100644
--- a/src/main/java/com/thealgorithms/others/HappyNumbersSeq.java
+++ b/src/main/java/com/thealgorithms/others/HappyNumbersSeq.java
@@ -5,7 +5,9 @@ import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
-public class HappyNumbersSeq {
+public final class HappyNumbersSeq {
+ private HappyNumbersSeq() {
+ }
private static final Set CYCLE_NUMS = new HashSet<>(Arrays.asList(4, 16, 20, 37, 58, 145));
diff --git a/src/main/java/com/thealgorithms/others/Huffman.java b/src/main/java/com/thealgorithms/others/Huffman.java
index cc8c8d098..4fdee5d5e 100644
--- a/src/main/java/com/thealgorithms/others/Huffman.java
+++ b/src/main/java/com/thealgorithms/others/Huffman.java
@@ -26,7 +26,9 @@ class MyComparator implements Comparator {
}
}
-public class Huffman {
+public final class Huffman {
+ private Huffman() {
+ }
// recursive function to print the
// huffman-code through the tree traversal.
diff --git a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
index d394ae102..e4a9cbba4 100644
--- a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
+++ b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-public class InsertDeleteInArray {
+public final class InsertDeleteInArray {
+ private InsertDeleteInArray() {
+ }
public static void main(String[] args) {
try (Scanner s = new Scanner(System.in)) {
diff --git a/src/main/java/com/thealgorithms/others/KMP.java b/src/main/java/com/thealgorithms/others/KMP.java
index 7fb5645a2..1caa6b63c 100644
--- a/src/main/java/com/thealgorithms/others/KMP.java
+++ b/src/main/java/com/thealgorithms/others/KMP.java
@@ -4,7 +4,9 @@ package com.thealgorithms.others;
* Implementation of Knuth–Morris–Pratt algorithm Usage: see the main function
* for an example
*/
-public class KMP {
+public final class KMP {
+ private KMP() {
+ }
// a working example
diff --git a/src/main/java/com/thealgorithms/others/KochSnowflake.java b/src/main/java/com/thealgorithms/others/KochSnowflake.java
index a87eedebe..1762d6cfa 100644
--- a/src/main/java/com/thealgorithms/others/KochSnowflake.java
+++ b/src/main/java/com/thealgorithms/others/KochSnowflake.java
@@ -24,7 +24,9 @@ import javax.imageio.ImageIO;
* https://natureofcode.com/book/chapter-8-fractals/
* #84-the-koch-curve-and-the-arraylist-technique ).
*/
-public class KochSnowflake {
+public final class KochSnowflake {
+ private KochSnowflake() {
+ }
public static void main(String[] args) {
// Test Iterate-method
diff --git a/src/main/java/com/thealgorithms/others/Krishnamurthy.java b/src/main/java/com/thealgorithms/others/Krishnamurthy.java
index 1f7cd1219..465d7e9c4 100644
--- a/src/main/java/com/thealgorithms/others/Krishnamurthy.java
+++ b/src/main/java/com/thealgorithms/others/Krishnamurthy.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-class Krishnamurthy {
+final class Krishnamurthy {
+ private Krishnamurthy() {
+ }
static int fact(int n) {
int i, p = 1;
diff --git a/src/main/java/com/thealgorithms/others/LineSweep.java b/src/main/java/com/thealgorithms/others/LineSweep.java
index 9aa0f6faa..cb7f5214b 100644
--- a/src/main/java/com/thealgorithms/others/LineSweep.java
+++ b/src/main/java/com/thealgorithms/others/LineSweep.java
@@ -11,7 +11,9 @@ import java.util.Comparator;
* https://en.wikipedia.org/wiki/Sweep_line_algorithm
* https://en.wikipedia.org/wiki/De_Morgan%27s_laws>
*/
-public class LineSweep {
+public final class LineSweep {
+ private LineSweep() {
+ }
/**
* Find Maximum end point
diff --git a/src/main/java/com/thealgorithms/others/Luhn.java b/src/main/java/com/thealgorithms/others/Luhn.java
index fd5433ca7..600128a77 100644
--- a/src/main/java/com/thealgorithms/others/Luhn.java
+++ b/src/main/java/com/thealgorithms/others/Luhn.java
@@ -38,7 +38,9 @@ import java.util.Objects;
*
* @see Wiki
*/
-public class Luhn {
+public final class Luhn {
+ private Luhn() {
+ }
/**
* Check input digits array by Luhn algorithm. Initial array doesn't change
diff --git a/src/main/java/com/thealgorithms/others/Mandelbrot.java b/src/main/java/com/thealgorithms/others/Mandelbrot.java
index 156184956..6d7588090 100644
--- a/src/main/java/com/thealgorithms/others/Mandelbrot.java
+++ b/src/main/java/com/thealgorithms/others/Mandelbrot.java
@@ -23,7 +23,9 @@ import javax.imageio.ImageIO;
* also https://en.wikipedia.org/wiki/Plotting_algorithms_for_the_Mandelbrot_set
* )
*/
-public class Mandelbrot {
+public final class Mandelbrot {
+ private Mandelbrot() {
+ }
public static void main(String[] args) {
// Test black and white
diff --git a/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java b/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java
index 3056f14da..0bafc435a 100644
--- a/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java
+++ b/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java
@@ -8,7 +8,9 @@ References: https://en.wikipedia.org/wiki/Streaming_algorithm
* items from the end of the window are removed from consideration while new items from the stream take their place.
* @author Swarga-codes (https://github.com/Swarga-codes)
*/
-public class MaximumSumOfDistinctSubarraysWithLengthK {
+public final class MaximumSumOfDistinctSubarraysWithLengthK {
+ private MaximumSumOfDistinctSubarraysWithLengthK() {
+ }
/*
* Returns the maximum sum of subarray of size K consisting of distinct
* elements.
diff --git a/src/main/java/com/thealgorithms/others/PasswordGen.java b/src/main/java/com/thealgorithms/others/PasswordGen.java
index c079d1cbe..f982848a5 100644
--- a/src/main/java/com/thealgorithms/others/PasswordGen.java
+++ b/src/main/java/com/thealgorithms/others/PasswordGen.java
@@ -11,11 +11,8 @@ import java.util.Random;
* @author AKS1996
* @date 2017.10.25
*/
-class PasswordGen {
-
- public static void main(String[] args) {
- String password = generatePassword(8, 16);
- System.out.print("Password: " + password);
+final class PasswordGen {
+ private PasswordGen() {
}
static String generatePassword(int min_length, int max_length) {
diff --git a/src/main/java/com/thealgorithms/others/PerlinNoise.java b/src/main/java/com/thealgorithms/others/PerlinNoise.java
index 2f774e16b..e6551ed6b 100644
--- a/src/main/java/com/thealgorithms/others/PerlinNoise.java
+++ b/src/main/java/com/thealgorithms/others/PerlinNoise.java
@@ -7,7 +7,9 @@ import java.util.Scanner;
* For detailed info and implementation see: Perlin-Noise
*/
-public class PerlinNoise {
+public final class PerlinNoise {
+ private PerlinNoise() {
+ }
/**
* @param width width of noise array
diff --git a/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java b/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java
index 2499d9373..259e108a3 100644
--- a/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java
+++ b/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java
@@ -112,7 +112,9 @@ class QueueWithStack {
*
* @author sahilb2 (https://www.github.com/sahilb2)
*/
-public class QueueUsingTwoStacks {
+public final class QueueUsingTwoStacks {
+ private QueueUsingTwoStacks() {
+ }
/**
* Main method
diff --git a/src/main/java/com/thealgorithms/others/RabinKarp.java b/src/main/java/com/thealgorithms/others/RabinKarp.java
index 6358ce4aa..8188a1a70 100644
--- a/src/main/java/com/thealgorithms/others/RabinKarp.java
+++ b/src/main/java/com/thealgorithms/others/RabinKarp.java
@@ -7,7 +7,9 @@ import java.util.Scanner;
// An implementation of Rabin-Karp string matching algorithm
// Program will simply end if there is no match
-public class RabinKarp {
+public final class RabinKarp {
+ private RabinKarp() {
+ }
public static Scanner SCANNER = null;
public static final int ALPHABET_SIZE = 256;
diff --git a/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java b/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java
index 5e4662b0b..695a10648 100644
--- a/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java
+++ b/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java
@@ -6,7 +6,9 @@ import java.io.InputStreamReader;
/**
* @author Varun Upadhyay (https://github.com/varunu28)
*/
-public class RemoveDuplicateFromString {
+public final class RemoveDuplicateFromString {
+ private RemoveDuplicateFromString() {
+ }
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
diff --git a/src/main/java/com/thealgorithms/others/ReturnSubsequence.java b/src/main/java/com/thealgorithms/others/ReturnSubsequence.java
index 0d8cbea0d..cf2f091a1 100644
--- a/src/main/java/com/thealgorithms/others/ReturnSubsequence.java
+++ b/src/main/java/com/thealgorithms/others/ReturnSubsequence.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-public class ReturnSubsequence {
+public final class ReturnSubsequence {
+ private ReturnSubsequence() {
+ }
public static void main(String[] args) {
System.out.println("Enter String: ");
diff --git a/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java b/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java
index 7c0fe0b2c..2c26f8eae 100644
--- a/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java
+++ b/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java
@@ -3,7 +3,9 @@ package com.thealgorithms.others;
/* Program to reverse a Stack using Recursion*/
import java.util.Stack;
-public class ReverseStackUsingRecursion {
+public final class ReverseStackUsingRecursion {
+ private ReverseStackUsingRecursion() {
+ }
// Stack
private static Stack stack = new Stack<>();
diff --git a/src/main/java/com/thealgorithms/others/RootPrecision.java b/src/main/java/com/thealgorithms/others/RootPrecision.java
index e22db1b99..a804f8f69 100644
--- a/src/main/java/com/thealgorithms/others/RootPrecision.java
+++ b/src/main/java/com/thealgorithms/others/RootPrecision.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-public class RootPrecision {
+public final class RootPrecision {
+ private RootPrecision() {
+ }
public static void main(String[] args) {
// take input
diff --git a/src/main/java/com/thealgorithms/others/RotateMatriceBy90Degree.java b/src/main/java/com/thealgorithms/others/RotateMatrixBy90Degrees.java
similarity index 92%
rename from src/main/java/com/thealgorithms/others/RotateMatriceBy90Degree.java
rename to src/main/java/com/thealgorithms/others/RotateMatrixBy90Degrees.java
index c9ebc4548..081b0d16d 100644
--- a/src/main/java/com/thealgorithms/others/RotateMatriceBy90Degree.java
+++ b/src/main/java/com/thealgorithms/others/RotateMatrixBy90Degrees.java
@@ -6,7 +6,9 @@ package com.thealgorithms.others;
*/
import java.util.Scanner;
-class Rotate_by_90_degree {
+class Rotate_by_90_degrees {
+ private Rotate_by_90_degrees() {
+ }
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
@@ -41,7 +43,9 @@ class Rotate_by_90_degree {
/**
* Class containing the algo to roate matrix by 90 degree
*/
-class Rotate {
+final class Rotate {
+ private Rotate() {
+ }
static void rotate(int[][] a) {
int n = a.length;
diff --git a/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java b/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java
index fa3869bc5..15148de17 100644
--- a/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java
+++ b/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java
@@ -6,7 +6,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
// An implementaion of string matching using finite automata
-public class StringMatchFiniteAutomata {
+public final class StringMatchFiniteAutomata {
+ private StringMatchFiniteAutomata() {
+ }
public static final int CHARS = 256;
public static int[][] FA;
diff --git a/src/main/java/com/thealgorithms/others/Sudoku.java b/src/main/java/com/thealgorithms/others/Sudoku.java
index d2bc1d5c7..d27a1648b 100644
--- a/src/main/java/com/thealgorithms/others/Sudoku.java
+++ b/src/main/java/com/thealgorithms/others/Sudoku.java
@@ -1,6 +1,8 @@
package com.thealgorithms.others;
-class Sudoku {
+final class Sudoku {
+ private Sudoku() {
+ }
public static boolean isSafe(int[][] board, int row, int col, int num) {
// Row has the unique (row-clash)
diff --git a/src/main/java/com/thealgorithms/others/TopKWords.java b/src/main/java/com/thealgorithms/others/TopKWords.java
index bb84d3f76..4e30bbb4b 100644
--- a/src/main/java/com/thealgorithms/others/TopKWords.java
+++ b/src/main/java/com/thealgorithms/others/TopKWords.java
@@ -11,7 +11,9 @@ import java.util.Scanner;
/* display the most frequent K words in the file and the times it appear
in the file – shown in order (ignore case and periods) */
-public class TopKWords {
+public final class TopKWords {
+ private TopKWords() {
+ }
static class CountWords {
diff --git a/src/main/java/com/thealgorithms/others/TowerOfHanoi.java b/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
index c0fb4d75f..8969c002c 100644
--- a/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
+++ b/src/main/java/com/thealgorithms/others/TowerOfHanoi.java
@@ -2,7 +2,9 @@ package com.thealgorithms.others;
import java.util.Scanner;
-class TowerOfHanoi {
+final class TowerOfHanoi {
+ private TowerOfHanoi() {
+ }
public static void shift(int n, String startPole, String intermediatePole, String endPole) {
// if n becomes zero the program returns thus ending the loop.
diff --git a/src/main/java/com/thealgorithms/others/TwoPointers.java b/src/main/java/com/thealgorithms/others/TwoPointers.java
index de44354a6..01391ec72 100644
--- a/src/main/java/com/thealgorithms/others/TwoPointers.java
+++ b/src/main/java/com/thealgorithms/others/TwoPointers.java
@@ -9,7 +9,9 @@ import java.util.Arrays;
*
* link: https://www.geeksforgeeks.org/two-pointers-technique/
*/
-class TwoPointers {
+final class TwoPointers {
+ private TwoPointers() {
+ }
/**
* Given a sorted array arr (sorted in ascending order). Find if there
diff --git a/src/main/java/com/thealgorithms/others/Verhoeff.java b/src/main/java/com/thealgorithms/others/Verhoeff.java
index 2144f373e..9088612aa 100644
--- a/src/main/java/com/thealgorithms/others/Verhoeff.java
+++ b/src/main/java/com/thealgorithms/others/Verhoeff.java
@@ -23,7 +23,9 @@ import java.util.Objects;
* @see Wiki.
* Verhoeff algorithm
*/
-public class Verhoeff {
+public final class Verhoeff {
+ private Verhoeff() {
+ }
/**
* Table {@code d}. Based on multiplication in the dihedral group D5 and is
diff --git a/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java b/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java
index f4ab56636..9bcd5df81 100644
--- a/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java
+++ b/src/main/java/com/thealgorithms/scheduling/PreemptivePriorityScheduling.java
@@ -24,7 +24,9 @@ class Process {
}
}
-public class PreemptivePriorityScheduling {
+public final class PreemptivePriorityScheduling {
+ private PreemptivePriorityScheduling() {
+ }
public static List preemptivePriorityScheduling(List processes) {
List ganttChart = new ArrayList<>();
PriorityQueue readyQueue = new PriorityQueue<>(Comparator.comparingInt(p -> - p.priority));
diff --git a/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java b/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java
index e4c0cf9d0..164f906a3 100644
--- a/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java
+++ b/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java
@@ -8,7 +8,9 @@ if it is smaller than the target, the rows above that element are ignored (becau
above it will also be smaller than the target), else that element is greater than the target, then
the rows below it are ignored.
*/
-public class BinarySearch2dArray {
+public final class BinarySearch2dArray {
+ private BinarySearch2dArray() {
+ }
static int[] BinarySearch(int[][] arr, int target) {
int rowCount = arr.length, colCount = arr[0].length;
diff --git a/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java b/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java
index 350a3a6fe..8e601f987 100644
--- a/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java
+++ b/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java
@@ -25,7 +25,9 @@ import java.util.Scanner;
1. [1,2,3,4] Number of rotations: 0 or 4(Both valid)
2. [15,17,2,3,5] Number of rotations: 3
*/
-class HowManyTimesRotated {
+final class HowManyTimesRotated {
+ private HowManyTimesRotated() {
+ }
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
diff --git a/src/main/java/com/thealgorithms/searches/LinearSearchThread.java b/src/main/java/com/thealgorithms/searches/LinearSearchThread.java
index 6e9d73af6..d3d04e4f7 100644
--- a/src/main/java/com/thealgorithms/searches/LinearSearchThread.java
+++ b/src/main/java/com/thealgorithms/searches/LinearSearchThread.java
@@ -2,7 +2,9 @@ package com.thealgorithms.searches;
import java.util.Scanner;
-public class LinearSearchThread {
+public final class LinearSearchThread {
+ private LinearSearchThread() {
+ }
public static void main(String[] args) {
int[] list = new int[200];
diff --git a/src/main/java/com/thealgorithms/searches/OrderAgnosticBinarySearch.java b/src/main/java/com/thealgorithms/searches/OrderAgnosticBinarySearch.java
index 8ae304f61..bb593503f 100644
--- a/src/main/java/com/thealgorithms/searches/OrderAgnosticBinarySearch.java
+++ b/src/main/java/com/thealgorithms/searches/OrderAgnosticBinarySearch.java
@@ -1,46 +1,48 @@
-package com.thealgorithms.searches;
-
-// URL: https://www.geeksforgeeks.org/order-agnostic-binary-search/
-
-/* Order Agnostic Binary Search is an algorithm where we do not know whether the given
- sorted array is ascending or descending order.
- We declare a boolean variable to find whether the array is ascending order.
- In the while loop, we use the two pointer method (start and end) to get the middle element.
- if the middle element is equal to our target element, then that is the answer.
- If not, then we check if the array is ascending or descending order.
- Depending upon the condition, respective statements will be executed and we will get our answer.
- */
-
-public class OrderAgnosticBinarySearch {
-
- static int BinSearchAlgo(int[] arr, int start, int end, int target) {
-
- // Checking whether the given array is ascending order
- boolean AscOrd = arr[start] < arr[end];
-
- while (start <= end) {
- int middle = start + (end - start) / 2;
-
- // Check if the desired element is present at the middle position
- if (arr[middle] == target) return middle; // returns the index of the middle element
-
- // Ascending order
- if (AscOrd) {
- if (arr[middle] < target)
- start = middle + 1;
- else
- end = middle - 1;
- }
-
- // Descending order
- else {
- if (arr[middle] > target)
- start = middle + 1;
- else
- end = middle - 1;
- }
- }
- // Element is not present
- return -1;
- }
-}
+package com.thealgorithms.searches;
+
+// URL: https://www.geeksforgeeks.org/order-agnostic-binary-search/
+
+/* Order Agnostic Binary Search is an algorithm where we do not know whether the given
+ sorted array is ascending or descending order.
+ We declare a boolean variable to find whether the array is ascending order.
+ In the while loop, we use the two pointer method (start and end) to get the middle element.
+ if the middle element is equal to our target element, then that is the answer.
+ If not, then we check if the array is ascending or descending order.
+ Depending upon the condition, respective statements will be executed and we will get our answer.
+ */
+
+public final class OrderAgnosticBinarySearch {
+ private OrderAgnosticBinarySearch() {
+ }
+
+ static int BinSearchAlgo(int[] arr, int start, int end, int target) {
+
+ // Checking whether the given array is ascending order
+ boolean AscOrd = arr[start] < arr[end];
+
+ while (start <= end) {
+ int middle = start + (end - start) / 2;
+
+ // Check if the desired element is present at the middle position
+ if (arr[middle] == target) return middle; // returns the index of the middle element
+
+ // Ascending order
+ if (AscOrd) {
+ if (arr[middle] < target)
+ start = middle + 1;
+ else
+ end = middle - 1;
+ }
+
+ // Descending order
+ else {
+ if (arr[middle] > target)
+ start = middle + 1;
+ else
+ end = middle - 1;
+ }
+ }
+ // Element is not present
+ return -1;
+ }
+}
diff --git a/src/main/java/com/thealgorithms/searches/QuickSelect.java b/src/main/java/com/thealgorithms/searches/QuickSelect.java
index f5ed7f71c..97eab4bb4 100644
--- a/src/main/java/com/thealgorithms/searches/QuickSelect.java
+++ b/src/main/java/com/thealgorithms/searches/QuickSelect.java
@@ -10,6 +10,8 @@ import java.util.Objects;
* here.
*/
public final class QuickSelect {
+ private QuickSelect() {
+ }
/**
* Selects the {@code n}-th largest element of {@code list}, i.e. the element that would
diff --git a/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java b/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java
index 4e5939d6b..6ec1aa5ce 100644
--- a/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java
+++ b/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java
@@ -16,7 +16,9 @@ import java.util.Scanner;
*
* @author Nishita Aggarwal
*/
-public class SaddlebackSearch {
+public final class SaddlebackSearch {
+ private SaddlebackSearch() {
+ }
/**
* This method performs Saddleback Search
diff --git a/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java b/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java
index afd5c194f..c00bfc9da 100644
--- a/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java
+++ b/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java
@@ -14,7 +14,9 @@ import java.util.Scanner;
*
* @author sahil
*/
-public class SquareRootBinarySearch {
+public final class SquareRootBinarySearch {
+ private SquareRootBinarySearch() {
+ }
/**
* This is the driver method.
diff --git a/src/main/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearch.java b/src/main/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearch.java
index 817d9b355..acb9fb5cb 100644
--- a/src/main/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearch.java
+++ b/src/main/java/com/thealgorithms/searches/sortOrderAgnosticBinarySearch.java
@@ -1,5 +1,7 @@
package com.thealgorithms.searches;
-public class sortOrderAgnosticBinarySearch {
+public final class sortOrderAgnosticBinarySearch {
+ private sortOrderAgnosticBinarySearch() {
+ }
public static int find(int[] arr, int key) {
int start = 0;
int end = arr.length - 1;
diff --git a/src/main/java/com/thealgorithms/sorts/BucketSort.java b/src/main/java/com/thealgorithms/sorts/BucketSort.java
index 184e36f04..2a48cca0f 100644
--- a/src/main/java/com/thealgorithms/sorts/BucketSort.java
+++ b/src/main/java/com/thealgorithms/sorts/BucketSort.java
@@ -8,7 +8,9 @@ import java.util.Random;
/**
* Wikipedia: https://en.wikipedia.org/wiki/Bucket_sort
*/
-public class BucketSort {
+public final class BucketSort {
+ private BucketSort() {
+ }
public static void main(String[] args) {
int[] arr = new int[10];
diff --git a/src/main/java/com/thealgorithms/sorts/DNFSort.java b/src/main/java/com/thealgorithms/sorts/DNFSort.java
index 7f50deca4..7074e2cbe 100644
--- a/src/main/java/com/thealgorithms/sorts/DNFSort.java
+++ b/src/main/java/com/thealgorithms/sorts/DNFSort.java
@@ -1,6 +1,8 @@
package com.thealgorithms.sorts;
-public class DNFSort {
+public final class DNFSort {
+ private DNFSort() {
+ }
// Sort the input array, the array is assumed to
// have values in {0, 1, 2}
diff --git a/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java b/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java
index f235d2105..803085f9f 100644
--- a/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java
+++ b/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java
@@ -6,7 +6,9 @@ import java.util.Scanner;
/*This code implements the mergeSort algorithm without extra space
For understanding about mergesort visit :https://www.geeksforgeeks.org/merge-sort/
*/
-public class MergeSortNoExtraSpace {
+public final class MergeSortNoExtraSpace {
+ private MergeSortNoExtraSpace() {
+ }
public static void call_merge_sort(int[] a, int n) {
int maxele = Arrays.stream(a).max().getAsInt() + 1;
diff --git a/src/main/java/com/thealgorithms/sorts/OddEvenSort.java b/src/main/java/com/thealgorithms/sorts/OddEvenSort.java
index b5213792d..fb6e4d264 100644
--- a/src/main/java/com/thealgorithms/sorts/OddEvenSort.java
+++ b/src/main/java/com/thealgorithms/sorts/OddEvenSort.java
@@ -3,7 +3,9 @@ package com.thealgorithms.sorts;
import java.util.Random;
// https://en.wikipedia.org/wiki/Odd%E2%80%93even_sort
-public class OddEvenSort {
+public final class OddEvenSort {
+ private OddEvenSort() {
+ }
public static void main(String[] args) {
int[] arr = new int[100];
diff --git a/src/main/java/com/thealgorithms/sorts/RadixSort.java b/src/main/java/com/thealgorithms/sorts/RadixSort.java
index d2090bf86..847b94036 100644
--- a/src/main/java/com/thealgorithms/sorts/RadixSort.java
+++ b/src/main/java/com/thealgorithms/sorts/RadixSort.java
@@ -2,7 +2,9 @@ package com.thealgorithms.sorts;
import java.util.Arrays;
-class RadixSort {
+final class RadixSort {
+ private RadixSort() {
+ }
private static int getMax(int[] arr, int n) {
int mx = arr[0];
diff --git a/src/main/java/com/thealgorithms/sorts/SortUtils.java b/src/main/java/com/thealgorithms/sorts/SortUtils.java
index 9e114b208..fda197518 100644
--- a/src/main/java/com/thealgorithms/sorts/SortUtils.java
+++ b/src/main/java/com/thealgorithms/sorts/SortUtils.java
@@ -5,6 +5,8 @@ import java.util.List;
import java.util.stream.Collectors;
final class SortUtils {
+ private SortUtils() {
+ }
/**
* Swaps two elements at the given positions in an array.
diff --git a/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java b/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java
index d39d40e79..b048d0245 100644
--- a/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java
+++ b/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java
@@ -2,7 +2,9 @@ package com.thealgorithms.sorts;
import java.util.Random;
-public class SortUtilsRandomGenerator {
+public final class SortUtilsRandomGenerator {
+ private SortUtilsRandomGenerator() {
+ }
private static final Random RANDOM;
private static final long SEED;
diff --git a/src/main/java/com/thealgorithms/sorts/StrandSort.java b/src/main/java/com/thealgorithms/sorts/StrandSort.java
index 2d8411fac..7e2251d70 100644
--- a/src/main/java/com/thealgorithms/sorts/StrandSort.java
+++ b/src/main/java/com/thealgorithms/sorts/StrandSort.java
@@ -3,7 +3,9 @@ package com.thealgorithms.sorts;
import java.util.Iterator;
import java.util.LinkedList;
-public class StrandSort {
+public final class StrandSort {
+ private StrandSort() {
+ }
// note: the input list is destroyed
public static > LinkedList strandSort(LinkedList list) {
diff --git a/src/main/java/com/thealgorithms/sorts/TopologicalSort.java b/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
index ac375e2a5..ce664b019 100644
--- a/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
+++ b/src/main/java/com/thealgorithms/sorts/TopologicalSort.java
@@ -16,7 +16,9 @@ import java.util.LinkedList;
* @author Jonathan Taylor (https://github.com/Jtmonument)
* Based on Introduction to Algorithms 3rd Edition
*/
-public class TopologicalSort {
+public final class TopologicalSort {
+ private TopologicalSort() {
+ }
/*
* Enum to represent the colors for the depth first search
diff --git a/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java b/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java
index a73697a7d..a8f5254b2 100644
--- a/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java
+++ b/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java
@@ -16,7 +16,9 @@ import java.util.Stack;
* @author khalil2535
* @author shellhub
*/
-class BalancedBrackets {
+final class BalancedBrackets {
+ private BalancedBrackets() {
+ }
/**
* Check if {@code leftBracket} and {@code rightBracket} is paired or not
diff --git a/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java b/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java
index 0a206a8ba..41d1c6408 100644
--- a/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java
+++ b/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java
@@ -2,7 +2,9 @@ package com.thealgorithms.stacks;
import java.util.Stack;
-public class DecimalToAnyUsingStack {
+public final class DecimalToAnyUsingStack {
+ private DecimalToAnyUsingStack() {
+ }
public static void main(String[] args) {
assert convert(0, 2).equals("0");
diff --git a/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java b/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java
index f78a24112..2fb03de77 100644
--- a/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java
+++ b/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java
@@ -11,7 +11,9 @@ package com.thealgorithms.stacks;
import java.util.Scanner;
import java.util.Stack;
-public class DuplicateBrackets {
+public final class DuplicateBrackets {
+ private DuplicateBrackets() {
+ }
public static boolean check(String str) {
Stack st = new Stack<>();
diff --git a/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java b/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java
index 2cafdc940..e3519978c 100644
--- a/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java
+++ b/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java
@@ -2,7 +2,9 @@ package com.thealgorithms.stacks;
import java.util.Stack;
-public class InfixToPostfix {
+public final class InfixToPostfix {
+ private InfixToPostfix() {
+ }
public static void main(String[] args) throws Exception {
assert "32+".equals(infix2PostFix("3+2"));
diff --git a/src/main/java/com/thealgorithms/stacks/LargestRectangle.java b/src/main/java/com/thealgorithms/stacks/LargestRectangle.java
index 63f1d0b4f..b3004a284 100644
--- a/src/main/java/com/thealgorithms/stacks/LargestRectangle.java
+++ b/src/main/java/com/thealgorithms/stacks/LargestRectangle.java
@@ -7,7 +7,9 @@ import java.util.Stack;
* @author mohd rameez github.com/rameez471
*/
-public class LargestRectangle {
+public final class LargestRectangle {
+ private LargestRectangle() {
+ }
public static String largestRectanglehistogram(int[] heights) {
int n = heights.length, maxArea = 0;
diff --git a/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java b/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java
index 5eb895d94..d76122b16 100644
--- a/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java
+++ b/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java
@@ -27,7 +27,9 @@ import java.util.Stack;
*
* @author sahil
*/
-public class MaximumMinimumWindow {
+public final class MaximumMinimumWindow {
+ private MaximumMinimumWindow() {
+ }
/**
* This function contains the logic of finding maximum of minimum for every
diff --git a/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java b/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java
index d681e41fb..f7cbea714 100644
--- a/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java
+++ b/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java
@@ -41,7 +41,9 @@ import java.util.Stack;
-1.
*/
-public class NextGreaterElement {
+public final class NextGreaterElement {
+ private NextGreaterElement() {
+ }
public static int[] findNextGreaterElements(int[] array) {
if (array == null) {
diff --git a/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java b/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java
index 84263d986..4d37da0e7 100644
--- a/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java
+++ b/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java
@@ -37,7 +37,9 @@ import java.util.Stack;
answer is -1
*/
-public class NextSmallerElement {
+public final class NextSmallerElement {
+ private NextSmallerElement() {
+ }
public static int[] findNextSmallerElements(int[] array) {
// base case
diff --git a/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java b/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java
index 0c674ec02..6a0453d88 100644
--- a/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java
+++ b/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java
@@ -16,7 +16,9 @@ import java.util.Stack;
*
*/
-public class PostfixToInfix {
+public final class PostfixToInfix {
+ private PostfixToInfix() {
+ }
public static boolean isOperator(char token) {
switch (token) {
diff --git a/src/main/java/com/thealgorithms/strings/Alphabetical.java b/src/main/java/com/thealgorithms/strings/Alphabetical.java
index fde17c883..de07dde2d 100644
--- a/src/main/java/com/thealgorithms/strings/Alphabetical.java
+++ b/src/main/java/com/thealgorithms/strings/Alphabetical.java
@@ -5,7 +5,9 @@ package com.thealgorithms.strings;
* based on the position of the characters in the conventional ordering of an
* alphabet. Wikipedia: https://en.wikipedia.org/wiki/Alphabetical_order
*/
-class Alphabetical {
+final class Alphabetical {
+ private Alphabetical() {
+ }
public static void main(String[] args) {
assert !isAlphabetical("123abc");
diff --git a/src/main/java/com/thealgorithms/strings/CharactersSame.java b/src/main/java/com/thealgorithms/strings/CharactersSame.java
index e0243fa8e..78ccbbea4 100644
--- a/src/main/java/com/thealgorithms/strings/CharactersSame.java
+++ b/src/main/java/com/thealgorithms/strings/CharactersSame.java
@@ -1,6 +1,8 @@
package com.thealgorithms.strings;
-public class CharactersSame {
+public final class CharactersSame {
+ private CharactersSame() {
+ }
/**
* Driver Code
diff --git a/src/main/java/com/thealgorithms/strings/CheckAnagrams.java b/src/main/java/com/thealgorithms/strings/CheckAnagrams.java
index a20e8b4ad..7bf7cd9a7 100644
--- a/src/main/java/com/thealgorithms/strings/CheckAnagrams.java
+++ b/src/main/java/com/thealgorithms/strings/CheckAnagrams.java
@@ -7,7 +7,9 @@ import java.util.Map;
* Two strings are anagrams if they are made of the same letters arranged
* differently (ignoring the case).
*/
-public class CheckAnagrams {
+public final class CheckAnagrams {
+ private CheckAnagrams() {
+ }
/**
* Check if two strings are anagrams or not
*
diff --git a/src/main/java/com/thealgorithms/strings/CheckVowels.java b/src/main/java/com/thealgorithms/strings/CheckVowels.java
index 7b4fca3d5..44965cc92 100644
--- a/src/main/java/com/thealgorithms/strings/CheckVowels.java
+++ b/src/main/java/com/thealgorithms/strings/CheckVowels.java
@@ -9,7 +9,9 @@ import java.util.Set;
* on the position of the characters in the conventional ordering of an
* alphabet. Wikipedia: https://en.wikipedia.org/wiki/Alphabetical_order
*/
-public class CheckVowels {
+public final class CheckVowels {
+ private CheckVowels() {
+ }
private static final Set VOWELS = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
diff --git a/src/main/java/com/thealgorithms/strings/HammingDistance.java b/src/main/java/com/thealgorithms/strings/HammingDistance.java
index bfa3114b1..95c523ccd 100644
--- a/src/main/java/com/thealgorithms/strings/HammingDistance.java
+++ b/src/main/java/com/thealgorithms/strings/HammingDistance.java
@@ -4,7 +4,9 @@ package com.thealgorithms.strings;
is the number of positions at which the corresponding symbols are different.
https://en.wikipedia.org/wiki/Hamming_distance
*/
-public class HammingDistance {
+public final class HammingDistance {
+ private HammingDistance() {
+ }
/**
* calculate the hamming distance between two strings of equal length
diff --git a/src/main/java/com/thealgorithms/strings/HorspoolSearch.java b/src/main/java/com/thealgorithms/strings/HorspoolSearch.java
index 99ba2399c..d9187cbf6 100644
--- a/src/main/java/com/thealgorithms/strings/HorspoolSearch.java
+++ b/src/main/java/com/thealgorithms/strings/HorspoolSearch.java
@@ -44,7 +44,9 @@ import java.util.HashMap;
* recommend checking out the wikipedia page and professor Anany Levitin's book:
* Introduction To The Design And Analysis Of Algorithms.
*/
-public class HorspoolSearch {
+public final class HorspoolSearch {
+ private HorspoolSearch() {
+ }
private static HashMap shiftValues; // bad symbol table
private static Integer patternLength;
diff --git a/src/main/java/com/thealgorithms/strings/Isomorphic.java b/src/main/java/com/thealgorithms/strings/Isomorphic.java
index d7f436b0d..088addc6e 100644
--- a/src/main/java/com/thealgorithms/strings/Isomorphic.java
+++ b/src/main/java/com/thealgorithms/strings/Isomorphic.java
@@ -5,7 +5,9 @@ import java.util.HashSet;
import java.util.Map;
import java.util.Set;
-public class Isomorphic {
+public final class Isomorphic {
+ private Isomorphic() {
+ }
public static boolean checkStrings(String s, String t) {
if (s.length() != t.length()) {
diff --git a/src/main/java/com/thealgorithms/strings/LetterCombinationsOfPhoneNumber.java b/src/main/java/com/thealgorithms/strings/LetterCombinationsOfPhoneNumber.java
index 963684e4a..2e3ee25fb 100644
--- a/src/main/java/com/thealgorithms/strings/LetterCombinationsOfPhoneNumber.java
+++ b/src/main/java/com/thealgorithms/strings/LetterCombinationsOfPhoneNumber.java
@@ -4,7 +4,9 @@ import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
-public class LetterCombinationsOfPhoneNumber {
+public final class LetterCombinationsOfPhoneNumber {
+ private LetterCombinationsOfPhoneNumber() {
+ }
static Character[][] numberToCharMap;
diff --git a/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java b/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java
index a74a10aa0..fa9171133 100644
--- a/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java
+++ b/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java
@@ -3,7 +3,9 @@ package com.thealgorithms.strings;
// Longest Palindromic Substring
import java.util.Scanner;
-class LongestPalindromicSubstring {
+final class LongestPalindromicSubstring {
+ private LongestPalindromicSubstring() {
+ }
public static void main(String[] args) {
Solution s = new Solution();
diff --git a/src/main/java/com/thealgorithms/strings/Lower.java b/src/main/java/com/thealgorithms/strings/Lower.java
index ef3902b15..e20cc5f0f 100644
--- a/src/main/java/com/thealgorithms/strings/Lower.java
+++ b/src/main/java/com/thealgorithms/strings/Lower.java
@@ -1,6 +1,8 @@
package com.thealgorithms.strings;
-public class Lower {
+public final class Lower {
+ private Lower() {
+ }
/**
* Driver Code
diff --git a/src/main/java/com/thealgorithms/strings/MyAtoi.java b/src/main/java/com/thealgorithms/strings/MyAtoi.java
index a8669273a..119d75e4d 100644
--- a/src/main/java/com/thealgorithms/strings/MyAtoi.java
+++ b/src/main/java/com/thealgorithms/strings/MyAtoi.java
@@ -3,7 +3,9 @@
package com.thealgorithms.strings;
-public class MyAtoi {
+public final class MyAtoi {
+ private MyAtoi() {
+ }
public static int myAtoi(String s) {
s = s.trim();
char[] char_1 = s.toCharArray();
diff --git a/src/main/java/com/thealgorithms/strings/Palindrome.java b/src/main/java/com/thealgorithms/strings/Palindrome.java
index c0cab91bb..3567a371d 100644
--- a/src/main/java/com/thealgorithms/strings/Palindrome.java
+++ b/src/main/java/com/thealgorithms/strings/Palindrome.java
@@ -3,7 +3,9 @@ package com.thealgorithms.strings;
/**
* Wikipedia: https://en.wikipedia.org/wiki/Palindrome
*/
-class Palindrome {
+final class Palindrome {
+ private Palindrome() {
+ }
/**
* Check if a string is palindrome string or not using String Builder
diff --git a/src/main/java/com/thealgorithms/strings/Pangram.java b/src/main/java/com/thealgorithms/strings/Pangram.java
index d2c9f3e5b..e0989ce86 100644
--- a/src/main/java/com/thealgorithms/strings/Pangram.java
+++ b/src/main/java/com/thealgorithms/strings/Pangram.java
@@ -5,7 +5,9 @@ import java.util.HashSet;
/**
* Wikipedia: https://en.wikipedia.org/wiki/Pangram
*/
-public class Pangram {
+public final class Pangram {
+ private Pangram() {
+ }
/**
* Test code
diff --git a/src/main/java/com/thealgorithms/strings/PermuteString.java b/src/main/java/com/thealgorithms/strings/PermuteString.java
index d4abb6744..f263292eb 100644
--- a/src/main/java/com/thealgorithms/strings/PermuteString.java
+++ b/src/main/java/com/thealgorithms/strings/PermuteString.java
@@ -11,7 +11,9 @@ Backtracking algorithm used in the program:-
again, and we backtrack to the previous position and swap B with C. So, now we got ABC and ACB.
>>Repeat these steps for BAC and CBA, to get all the permutations.
*/
-public class PermuteString {
+public final class PermuteString {
+ private PermuteString() {
+ }
// Function for swapping the characters at position I with character at position j
public static String swapString(String a, int i, int j) {
diff --git a/src/main/java/com/thealgorithms/strings/ReverseString.java b/src/main/java/com/thealgorithms/strings/ReverseString.java
index c5f54f745..b47a77e92 100644
--- a/src/main/java/com/thealgorithms/strings/ReverseString.java
+++ b/src/main/java/com/thealgorithms/strings/ReverseString.java
@@ -3,7 +3,9 @@ package com.thealgorithms.strings;
/**
* Reverse String using different version
*/
-public class ReverseString {
+public final class ReverseString {
+ private ReverseString() {
+ }
public static void main(String[] args) {
assert reverse("abc123").equals("321cba");
diff --git a/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java b/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java
index 0cd2a971b..e180f6c39 100644
--- a/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java
+++ b/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java
@@ -4,7 +4,9 @@ package com.thealgorithms.strings;
* Reverse String using Recursion
*/
-public class ReverseStringRecursive {
+public final class ReverseStringRecursive {
+ private ReverseStringRecursive() {
+ }
/**
* @param str string to be reversed
* @return reversed string
diff --git a/src/main/java/com/thealgorithms/strings/Rotation.java b/src/main/java/com/thealgorithms/strings/Rotation.java
index c82ae5c32..e1352f119 100644
--- a/src/main/java/com/thealgorithms/strings/Rotation.java
+++ b/src/main/java/com/thealgorithms/strings/Rotation.java
@@ -6,7 +6,9 @@ package com.thealgorithms.strings;
* the string "abcdef" to the end of the string, so that the original string
* becomes the string "cdefab"
*/
-public class Rotation {
+public final class Rotation {
+ private Rotation() {
+ }
public static void main(String[] args) {
assert rotation("abcdef", 2).equals("cdefab");
diff --git a/src/main/java/com/thealgorithms/strings/StringCompression.java b/src/main/java/com/thealgorithms/strings/StringCompression.java
index 28a3df743..131bd4165 100644
--- a/src/main/java/com/thealgorithms/strings/StringCompression.java
+++ b/src/main/java/com/thealgorithms/strings/StringCompression.java
@@ -4,7 +4,9 @@ package com.thealgorithms.strings;
* string
* @author Swarga-codes (https://github.com/Swarga-codes)
*/
-public class StringCompression {
+public final class StringCompression {
+ private StringCompression() {
+ }
/**
* Returns the compressed or encoded string
*
diff --git a/src/main/java/com/thealgorithms/strings/Upper.java b/src/main/java/com/thealgorithms/strings/Upper.java
index 8f306a20e..0fc87a9da 100644
--- a/src/main/java/com/thealgorithms/strings/Upper.java
+++ b/src/main/java/com/thealgorithms/strings/Upper.java
@@ -1,6 +1,8 @@
package com.thealgorithms.strings;
-public class Upper {
+public final class Upper {
+ private Upper() {
+ }
/**
* Driver Code
diff --git a/src/main/java/com/thealgorithms/strings/ValidParentheses.java b/src/main/java/com/thealgorithms/strings/ValidParentheses.java
index 5d3738522..b2759e5bc 100644
--- a/src/main/java/com/thealgorithms/strings/ValidParentheses.java
+++ b/src/main/java/com/thealgorithms/strings/ValidParentheses.java
@@ -4,7 +4,9 @@ package com.thealgorithms.strings;
// the same type of brackets. Open brackets must be closed in the correct order. Every close
// bracket has a corresponding open bracket of the same type.
-public class ValidParentheses {
+public final class ValidParentheses {
+ private ValidParentheses() {
+ }
public static boolean isValid(String s) {
char[] stack = new char[s.length()];
int head = 0;
diff --git a/src/main/java/com/thealgorithms/strings/WordLadder.java b/src/main/java/com/thealgorithms/strings/WordLadder.java
index e88acbd18..025c43b15 100644
--- a/src/main/java/com/thealgorithms/strings/WordLadder.java
+++ b/src/main/java/com/thealgorithms/strings/WordLadder.java
@@ -38,7 +38,9 @@ import java.util.Queue;
All the words in wordList are unique.
*/
-class WordLadder {
+final class WordLadder {
+ private WordLadder() {
+ }
/**
* This function finds the ladderLength
diff --git a/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java b/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java
index 252517dc8..361912474 100644
--- a/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java
+++ b/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java
@@ -2,7 +2,9 @@ package com.thealgorithms.strings;
import java.util.HashMap;
-class longestNonRepeativeSubstring {
+final class longestNonRepeativeSubstring {
+ private longestNonRepeativeSubstring() {
+ }
public static int lengthOfLongestSubstring(String s) {
int max = 0, start = 0, i = 0;
diff --git a/src/main/java/com/thealgorithms/strings/zigZagPattern/zigZagPattern.java b/src/main/java/com/thealgorithms/strings/zigZagPattern/zigZagPattern.java
index 75ab88338..ea366ad83 100644
--- a/src/main/java/com/thealgorithms/strings/zigZagPattern/zigZagPattern.java
+++ b/src/main/java/com/thealgorithms/strings/zigZagPattern/zigZagPattern.java
@@ -1,6 +1,8 @@
package com.thealgorithms.strings.zigZagPattern;
-class zigZagPattern {
+final class zigZagPattern {
+ private zigZagPattern() {
+ }
public static String encode(String s, int numRows) {
if (numRows < 2 || s.length() < numRows) return s;
diff --git a/src/test/java/com/thealgorithms/datastructures/trees/TreeTestUtils.java b/src/test/java/com/thealgorithms/datastructures/trees/TreeTestUtils.java
index 3bd197bf8..9628e86b9 100644
--- a/src/test/java/com/thealgorithms/datastructures/trees/TreeTestUtils.java
+++ b/src/test/java/com/thealgorithms/datastructures/trees/TreeTestUtils.java
@@ -4,7 +4,9 @@ import com.thealgorithms.datastructures.trees.BinaryTree.Node;
import java.util.LinkedList;
import java.util.Queue;
-public class TreeTestUtils {
+public final class TreeTestUtils {
+ private TreeTestUtils() {
+ }
/**
* Creates a binary tree with given values
diff --git a/src/test/java/com/thealgorithms/others/ArrayRightRotation.java b/src/test/java/com/thealgorithms/others/ArrayRightRotation.java
index a78ef81f3..11e4f4450 100644
--- a/src/test/java/com/thealgorithms/others/ArrayRightRotation.java
+++ b/src/test/java/com/thealgorithms/others/ArrayRightRotation.java
@@ -1,6 +1,8 @@
package com.thealgorithms.others;
-public class ArrayRightRotation {
+public final class ArrayRightRotation {
+ private ArrayRightRotation() {
+ }
public static int[] rotateRight(int[] arr, int k) {
if (arr == null || arr.length == 0 || k < 0) {
throw new IllegalArgumentException("Invalid input");
diff --git a/src/test/java/com/thealgorithms/others/CRC16Test.java b/src/test/java/com/thealgorithms/others/CRC16Test.java
index 54e82f69a..bf309928b 100644
--- a/src/test/java/com/thealgorithms/others/CRC16Test.java
+++ b/src/test/java/com/thealgorithms/others/CRC16Test.java
@@ -5,9 +5,6 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
class CRC16Test {
-
- CRC16 crc = new CRC16();
-
@Test
void testCRC16() {
// given
diff --git a/src/test/java/com/thealgorithms/strings/IsomorphicTest.java b/src/test/java/com/thealgorithms/strings/IsomorphicTest.java
index 4601404c7..0dac47551 100644
--- a/src/test/java/com/thealgorithms/strings/IsomorphicTest.java
+++ b/src/test/java/com/thealgorithms/strings/IsomorphicTest.java
@@ -5,7 +5,9 @@ import static org.junit.jupiter.api.Assertions.assertTrue;
import org.junit.jupiter.api.Test;
-public class IsomorphicTest {
+public final class IsomorphicTest {
+ private IsomorphicTest() {
+ }
@Test
public static void main(String[] args) {
diff --git a/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java b/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java
index af8d20ab9..b33037f37 100644
--- a/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java
+++ b/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java
@@ -5,8 +5,6 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
import org.junit.jupiter.api.Test;
public class ReverseStringRecursiveTest {
- ReverseStringRecursive stringRecursive = new ReverseStringRecursive();
-
@Test
void shouldAcceptWhenEmptyStringIsPassed() {
String expected = "";