diff --git a/checkstyle.xml b/checkstyle.xml index 8424e07f2694..5bbc5d72229a 100644 --- a/checkstyle.xml +++ b/checkstyle.xml @@ -175,7 +175,7 @@ - + diff --git a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java index a25bf51de898..a0b886e6be8a 100644 --- a/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java +++ b/src/main/java/com/thealgorithms/backtracking/ArrayCombination.java @@ -7,7 +7,9 @@ * Finds all permutations of 1...n of length k * @author TheClerici (git-TheClerici) */ -public class ArrayCombination { +public final class ArrayCombination { + private ArrayCombination() { + } private static int length; /** diff --git a/src/main/java/com/thealgorithms/backtracking/Combination.java b/src/main/java/com/thealgorithms/backtracking/Combination.java index 3908da43b36a..80c11ce737fa 100644 --- a/src/main/java/com/thealgorithms/backtracking/Combination.java +++ b/src/main/java/com/thealgorithms/backtracking/Combination.java @@ -9,7 +9,9 @@ * Finds all permutations of given array * @author Alan Piao (git-Alan Piao) */ -public class Combination { +public final class Combination { + private Combination() { + } private static int length; diff --git a/src/main/java/com/thealgorithms/backtracking/KnightsTour.java b/src/main/java/com/thealgorithms/backtracking/KnightsTour.java index 694f4ad18b08..2287b39da385 100644 --- a/src/main/java/com/thealgorithms/backtracking/KnightsTour.java +++ b/src/main/java/com/thealgorithms/backtracking/KnightsTour.java @@ -26,7 +26,9 @@ 51 46 55 44 53 4 21 12 */ -public class KnightsTour { +public final class KnightsTour { + private KnightsTour() { + } private static final int BASE = 12; private static final int[][] MOVES = { diff --git a/src/main/java/com/thealgorithms/backtracking/MColoring.java b/src/main/java/com/thealgorithms/backtracking/MColoring.java index d7d0a1d2f36b..20c42e59e8a1 100644 --- a/src/main/java/com/thealgorithms/backtracking/MColoring.java +++ b/src/main/java/com/thealgorithms/backtracking/MColoring.java @@ -14,7 +14,9 @@ class Node { Set edges = new HashSet(); } -public class MColoring { +public final class MColoring { + private MColoring() { + } static int possiblePaint(ArrayList nodes, int n, int m) { // Create a visited array of n nodes diff --git a/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java b/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java index 23fc0689fd57..f7eae01e449a 100644 --- a/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java +++ b/src/main/java/com/thealgorithms/backtracking/MazeRecursion.java @@ -1,6 +1,8 @@ package com.thealgorithms.backtracking; -public class MazeRecursion { +public final class MazeRecursion { + private MazeRecursion() { + } public static void mazeRecursion() { // First create a 2 dimensions array to mimic a maze map diff --git a/src/main/java/com/thealgorithms/backtracking/NQueens.java b/src/main/java/com/thealgorithms/backtracking/NQueens.java index e40b82915cc9..e21a8bb7174c 100644 --- a/src/main/java/com/thealgorithms/backtracking/NQueens.java +++ b/src/main/java/com/thealgorithms/backtracking/NQueens.java @@ -32,7 +32,9 @@ * queen is not placed safely. If there is no such way then return an empty list * as solution */ -public class NQueens { +public final class NQueens { + private NQueens() { + } public static void main(String[] args) { placeQueens(1); diff --git a/src/main/java/com/thealgorithms/backtracking/Permutation.java b/src/main/java/com/thealgorithms/backtracking/Permutation.java index 5d88c846087e..21d26e53980f 100644 --- a/src/main/java/com/thealgorithms/backtracking/Permutation.java +++ b/src/main/java/com/thealgorithms/backtracking/Permutation.java @@ -7,7 +7,9 @@ * Finds all permutations of given array * @author Alan Piao (Git-Alan Piao) */ -public class Permutation { +public final class Permutation { + private Permutation() { + } /** * Find all permutations of given array using backtracking diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java b/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java index dc8a217875f9..b825916a8674 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/IndexOfRightMostSetBit.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi) */ -public class IndexOfRightMostSetBit { +public final class IndexOfRightMostSetBit { + private IndexOfRightMostSetBit() { + } public static int indexOfRightMostSetBit(int n) { if (n == 0) { return -1; // No set bits diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java b/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java index b6bdc25fcc2b..09d5383322ff 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/IsEven.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi) */ -public class IsEven { +public final class IsEven { + private IsEven() { + } public static boolean isEven(int number) { return (number & 1) == 0; } diff --git a/src/main/java/com/thealgorithms/bitmanipulation/IsPowerTwo.java b/src/main/java/com/thealgorithms/bitmanipulation/IsPowerTwo.java index d379cb3f0593..54d28d4d22cc 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/IsPowerTwo.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/IsPowerTwo.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi) */ -public class IsPowerTwo { +public final class IsPowerTwo { + private IsPowerTwo() { + } public static boolean isPowerTwo(int number) { if (number <= 0) { return false; diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java b/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java index bd4bdb0becae..07476a8b9476 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/NonRepeatingNumberFinder.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi) */ -public class NonRepeatingNumberFinder { +public final class NonRepeatingNumberFinder { + private NonRepeatingNumberFinder() { + } public static int findNonRepeatingNumber(int[] arr) { int result = 0; diff --git a/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java b/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java index ed586296776f..8e0946f0eb23 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/NumbersDifferentSigns.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi */ -public class NumbersDifferentSigns { +public final class NumbersDifferentSigns { + private NumbersDifferentSigns() { + } public static boolean differentSigns(int num1, int num2) { return (num1 ^ num2) < 0; diff --git a/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java b/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java index e9d1ad61996f..e8f2930d3afe 100644 --- a/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java +++ b/src/main/java/com/thealgorithms/bitmanipulation/ReverseBits.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi */ -public class ReverseBits { +public final class ReverseBits { + private ReverseBits() { + } public static int reverseBits(int n) { int result = 0; diff --git a/src/main/java/com/thealgorithms/ciphers/AES.java b/src/main/java/com/thealgorithms/ciphers/AES.java index e310d7189b2a..cd04395e1b72 100644 --- a/src/main/java/com/thealgorithms/ciphers/AES.java +++ b/src/main/java/com/thealgorithms/ciphers/AES.java @@ -7,7 +7,9 @@ * This class is build to demonstrate the application of the AES-algorithm on a * single 128-Bit block of data. */ -public class AES { +public final class AES { + private AES() { + } /** * Precalculated values for x to the power of 2 in Rijndaels galois field. diff --git a/src/main/java/com/thealgorithms/ciphers/AESEncryption.java b/src/main/java/com/thealgorithms/ciphers/AESEncryption.java index 92c1f6f5a4fd..14582205442f 100644 --- a/src/main/java/com/thealgorithms/ciphers/AESEncryption.java +++ b/src/main/java/com/thealgorithms/ciphers/AESEncryption.java @@ -17,7 +17,9 @@ * hence in the following program we display it in hexadecimal format of the * underlying bytes. */ -public class AESEncryption { +public final class AESEncryption { + private AESEncryption() { + } private static final char[] HEX_ARRAY = "0123456789ABCDEF".toCharArray(); private static Cipher aesCipher; diff --git a/src/main/java/com/thealgorithms/ciphers/AffineCipher.java b/src/main/java/com/thealgorithms/ciphers/AffineCipher.java index 9ff63ddfe7c5..6e819f56041c 100644 --- a/src/main/java/com/thealgorithms/ciphers/AffineCipher.java +++ b/src/main/java/com/thealgorithms/ciphers/AffineCipher.java @@ -1,6 +1,8 @@ package com.thealgorithms.ciphers; -class AffineCipher { +final class AffineCipher { + private AffineCipher() { + } // Key values of a and b static int a = 17; diff --git a/src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java b/src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java index 89a0a88654ae..e59cfb12d816 100644 --- a/src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java +++ b/src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java @@ -7,7 +7,9 @@ * * @author freitzzz */ -public class ColumnarTranspositionCipher { +public final class ColumnarTranspositionCipher { + private ColumnarTranspositionCipher() { + } private static String keyword; private static Object[][] table; diff --git a/src/main/java/com/thealgorithms/ciphers/HillCipher.java b/src/main/java/com/thealgorithms/ciphers/HillCipher.java index a3226cef7de1..a858eb402939 100644 --- a/src/main/java/com/thealgorithms/ciphers/HillCipher.java +++ b/src/main/java/com/thealgorithms/ciphers/HillCipher.java @@ -11,7 +11,9 @@ * for encryption. The cipher key and plaintext/ciphertext are user inputs. * @author Ojasva Jain */ -public class HillCipher { +public final class HillCipher { + private HillCipher() { + } static Scanner userInput = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/ciphers/Polybius.java b/src/main/java/com/thealgorithms/ciphers/Polybius.java index b28cac8a586e..6b3cd6ccae81 100644 --- a/src/main/java/com/thealgorithms/ciphers/Polybius.java +++ b/src/main/java/com/thealgorithms/ciphers/Polybius.java @@ -13,7 +13,9 @@ * @author Hikmet ÇAKIR * @since 08-07-2022+03:00 */ -public class Polybius { +public final class Polybius { + private Polybius() { + } private static final char[][] KEY = { // 0 1 2 3 4 diff --git a/src/main/java/com/thealgorithms/ciphers/ProductCipher.java b/src/main/java/com/thealgorithms/ciphers/ProductCipher.java index 5b1d46fe9a9a..fb49d6cd61db 100644 --- a/src/main/java/com/thealgorithms/ciphers/ProductCipher.java +++ b/src/main/java/com/thealgorithms/ciphers/ProductCipher.java @@ -2,7 +2,9 @@ import java.util.Scanner; -class ProductCipher { +final class ProductCipher { + private ProductCipher() { + } public static void main(String[] args) { try (Scanner sc = new Scanner(System.in)) { diff --git a/src/main/java/com/thealgorithms/ciphers/a5/Utils.java b/src/main/java/com/thealgorithms/ciphers/a5/Utils.java index abdd11d6b72d..b4addf18dd9d 100644 --- a/src/main/java/com/thealgorithms/ciphers/a5/Utils.java +++ b/src/main/java/com/thealgorithms/ciphers/a5/Utils.java @@ -7,7 +7,9 @@ import java.util.BitSet; -public class Utils { +public final class Utils { + private Utils() { + } public static boolean increment(BitSet bits, int size) { int i = size - 1; diff --git a/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java b/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java index 7a87fd15be23..a5fc72c8bfb4 100644 --- a/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java +++ b/src/main/java/com/thealgorithms/conversions/AnyBaseToAnyBase.java @@ -13,7 +13,9 @@ * @author Michael Rolland * @version 2017.10.10 */ -public class AnyBaseToAnyBase { +public final class AnyBaseToAnyBase { + private AnyBaseToAnyBase() { + } /** * Smallest and largest base you want to accept as valid input diff --git a/src/main/java/com/thealgorithms/conversions/AnyBaseToDecimal.java b/src/main/java/com/thealgorithms/conversions/AnyBaseToDecimal.java index 20f15bc2ff39..6b4b14adc955 100644 --- a/src/main/java/com/thealgorithms/conversions/AnyBaseToDecimal.java +++ b/src/main/java/com/thealgorithms/conversions/AnyBaseToDecimal.java @@ -4,7 +4,9 @@ * @author Varun Upadhyay (...) */ // Driver program -public class AnyBaseToDecimal { +public final class AnyBaseToDecimal { + private AnyBaseToDecimal() { + } public static void main(String[] args) { assert convertToDecimal("1010", 2) == Integer.valueOf("1010", 2); diff --git a/src/main/java/com/thealgorithms/conversions/AnytoAny.java b/src/main/java/com/thealgorithms/conversions/AnytoAny.java index 052d6dba6953..609a81561b1b 100644 --- a/src/main/java/com/thealgorithms/conversions/AnytoAny.java +++ b/src/main/java/com/thealgorithms/conversions/AnytoAny.java @@ -6,7 +6,9 @@ // number. // sn ,sb,db ---> ()dn . this is what we have to do . -public class AnytoAny { +public final class AnytoAny { + private AnytoAny() { + } public static void main(String[] args) { Scanner scn = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/conversions/BinaryToDecimal.java b/src/main/java/com/thealgorithms/conversions/BinaryToDecimal.java index fdf9df7b2467..57d49d7b17f8 100644 --- a/src/main/java/com/thealgorithms/conversions/BinaryToDecimal.java +++ b/src/main/java/com/thealgorithms/conversions/BinaryToDecimal.java @@ -5,7 +5,9 @@ /** * This class converts a Binary number to a Decimal number */ -class BinaryToDecimal { +final class BinaryToDecimal { + private BinaryToDecimal() { + } public static long binaryToDecimal(long binNum) { long binCopy, d, s = 0, power = 0; diff --git a/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java b/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java index 9980d6deb8fc..a19baba39715 100644 --- a/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java +++ b/src/main/java/com/thealgorithms/conversions/BinaryToHexadecimal.java @@ -8,7 +8,9 @@ * * @author Nishita Aggarwal */ -public class BinaryToHexadecimal { +public final class BinaryToHexadecimal { + private BinaryToHexadecimal() { + } /** * This method converts a binary number to a hexadecimal number. diff --git a/src/main/java/com/thealgorithms/conversions/BinaryToOctal.java b/src/main/java/com/thealgorithms/conversions/BinaryToOctal.java index 70bad812141b..f171cdf69801 100644 --- a/src/main/java/com/thealgorithms/conversions/BinaryToOctal.java +++ b/src/main/java/com/thealgorithms/conversions/BinaryToOctal.java @@ -7,7 +7,9 @@ * * @author Zachary Jones */ -public class BinaryToOctal { +public final class BinaryToOctal { + private BinaryToOctal() { + } /** * Main method diff --git a/src/main/java/com/thealgorithms/conversions/DecimalToAnyBase.java b/src/main/java/com/thealgorithms/conversions/DecimalToAnyBase.java index 2d0223a4c448..019c4026bfb5 100644 --- a/src/main/java/com/thealgorithms/conversions/DecimalToAnyBase.java +++ b/src/main/java/com/thealgorithms/conversions/DecimalToAnyBase.java @@ -8,7 +8,9 @@ * @author Varun Upadhyay (...) */ // Driver Program -public class DecimalToAnyBase { +public final class DecimalToAnyBase { + private DecimalToAnyBase() { + } public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); diff --git a/src/main/java/com/thealgorithms/conversions/DecimalToBinary.java b/src/main/java/com/thealgorithms/conversions/DecimalToBinary.java index a6119cfbc9bc..329985a05fde 100644 --- a/src/main/java/com/thealgorithms/conversions/DecimalToBinary.java +++ b/src/main/java/com/thealgorithms/conversions/DecimalToBinary.java @@ -5,7 +5,9 @@ /** * This class converts a Decimal number to a Binary number */ -class DecimalToBinary { +final class DecimalToBinary { + private DecimalToBinary() { + } /** * Main Method diff --git a/src/main/java/com/thealgorithms/conversions/DecimalToHexaDecimal.java b/src/main/java/com/thealgorithms/conversions/DecimalToHexaDecimal.java index 1435c7f8b5fa..78838c6107b7 100644 --- a/src/main/java/com/thealgorithms/conversions/DecimalToHexaDecimal.java +++ b/src/main/java/com/thealgorithms/conversions/DecimalToHexaDecimal.java @@ -1,7 +1,9 @@ package com.thealgorithms.conversions; // hex = [0 - 9] -> [A - F] -class DecimalToHexaDecimal { +final class DecimalToHexaDecimal { + private DecimalToHexaDecimal() { + } private static final int SIZE_OF_INT_IN_HALF_BYTES = 8; private static final int NUMBER_OF_BITS_IN_HALF_BYTE = 4; diff --git a/src/main/java/com/thealgorithms/conversions/DecimalToOctal.java b/src/main/java/com/thealgorithms/conversions/DecimalToOctal.java index 0f72f462c753..1d0a6f1a1060 100644 --- a/src/main/java/com/thealgorithms/conversions/DecimalToOctal.java +++ b/src/main/java/com/thealgorithms/conversions/DecimalToOctal.java @@ -5,7 +5,9 @@ /** * This class converts Decimal numbers to Octal Numbers */ -public class DecimalToOctal { +public final class DecimalToOctal { + private DecimalToOctal() { + } /** * Main Method diff --git a/src/main/java/com/thealgorithms/conversions/HexToOct.java b/src/main/java/com/thealgorithms/conversions/HexToOct.java index 2a57fbde5c41..b4994ae0f5fb 100644 --- a/src/main/java/com/thealgorithms/conversions/HexToOct.java +++ b/src/main/java/com/thealgorithms/conversions/HexToOct.java @@ -7,7 +7,9 @@ * * @author Tanmay Joshi */ -public class HexToOct { +public final class HexToOct { + private HexToOct() { + } /** * This method converts a Hexadecimal number to a decimal number diff --git a/src/main/java/com/thealgorithms/conversions/HexaDecimalToDecimal.java b/src/main/java/com/thealgorithms/conversions/HexaDecimalToDecimal.java index 7675c83ebcfa..e8a44cb827d5 100644 --- a/src/main/java/com/thealgorithms/conversions/HexaDecimalToDecimal.java +++ b/src/main/java/com/thealgorithms/conversions/HexaDecimalToDecimal.java @@ -2,7 +2,9 @@ import java.util.Scanner; -public class HexaDecimalToDecimal { +public final class HexaDecimalToDecimal { + private HexaDecimalToDecimal() { + } // convert hexadecimal to decimal public static int getHexaToDec(String hex) { diff --git a/src/main/java/com/thealgorithms/conversions/IntegerToRoman.java b/src/main/java/com/thealgorithms/conversions/IntegerToRoman.java index 5507ab1169af..9c031df9504d 100644 --- a/src/main/java/com/thealgorithms/conversions/IntegerToRoman.java +++ b/src/main/java/com/thealgorithms/conversions/IntegerToRoman.java @@ -7,7 +7,9 @@ * ('I', 1); ('IV',4); ('V', 5); ('IX',9); ('X', 10); ('XL',40); ('L', 50); * ('XC',90); ('C', 100); ('D', 500); ('M', 1000); */ -public class IntegerToRoman { +public final class IntegerToRoman { + private IntegerToRoman() { + } private static final int[] ALL_ROMAN_NUMBERS_IN_ARABIC = new int[] { 1000, diff --git a/src/main/java/com/thealgorithms/conversions/OctalToBinary.java b/src/main/java/com/thealgorithms/conversions/OctalToBinary.java index 4dd581bd6116..6b01c2f65cfe 100644 --- a/src/main/java/com/thealgorithms/conversions/OctalToBinary.java +++ b/src/main/java/com/thealgorithms/conversions/OctalToBinary.java @@ -6,7 +6,9 @@ * @author Bama Charan Chhandogi */ -public class OctalToBinary { +public final class OctalToBinary { + private OctalToBinary() { + } public static long convertOctalToBinary(int octalNumber) { long binaryNumber = 0; int digitPosition = 1; diff --git a/src/main/java/com/thealgorithms/conversions/OctalToDecimal.java b/src/main/java/com/thealgorithms/conversions/OctalToDecimal.java index d4916a3dbcca..187f0ed1e2ea 100644 --- a/src/main/java/com/thealgorithms/conversions/OctalToDecimal.java +++ b/src/main/java/com/thealgorithms/conversions/OctalToDecimal.java @@ -7,7 +7,9 @@ * * @author Zachary Jones */ -public class OctalToDecimal { +public final class OctalToDecimal { + private OctalToDecimal() { + } /** * Main method diff --git a/src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java b/src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java index 5edd94c38430..5cc97fde12aa 100644 --- a/src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java +++ b/src/main/java/com/thealgorithms/conversions/OctalToHexadecimal.java @@ -7,7 +7,9 @@ * * @author Tanmay Joshi */ -public class OctalToHexadecimal { +public final class OctalToHexadecimal { + private OctalToHexadecimal() { + } /** * This method converts a Octal number to a decimal number diff --git a/src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java b/src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java index 65cb00fc0ad0..84cbff09db6b 100644 --- a/src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java +++ b/src/main/java/com/thealgorithms/conversions/RgbHsvConversion.java @@ -13,7 +13,9 @@ * (description adapted from [1] and * [2]). */ -public class RgbHsvConversion { +public final class RgbHsvConversion { + private RgbHsvConversion() { + } public static void main(String[] args) { // Expected RGB-values taken from https://www.rapidtables.com/convert/color/hsv-to-rgb.html diff --git a/src/main/java/com/thealgorithms/conversions/RomanToInteger.java b/src/main/java/com/thealgorithms/conversions/RomanToInteger.java index 1338ba9bb8ef..6ffb41c3c0e2 100644 --- a/src/main/java/com/thealgorithms/conversions/RomanToInteger.java +++ b/src/main/java/com/thealgorithms/conversions/RomanToInteger.java @@ -3,7 +3,9 @@ import java.util.HashMap; import java.util.Map; -public class RomanToInteger { +public final class RomanToInteger { + private RomanToInteger() { + } private static final Map ROMAN_TO_INT = new HashMap<>() { { diff --git a/src/main/java/com/thealgorithms/conversions/TurkishToLatinConversion.java b/src/main/java/com/thealgorithms/conversions/TurkishToLatinConversion.java index a96791b7706b..4d13b8b7fd55 100644 --- a/src/main/java/com/thealgorithms/conversions/TurkishToLatinConversion.java +++ b/src/main/java/com/thealgorithms/conversions/TurkishToLatinConversion.java @@ -7,7 +7,9 @@ * * @author Özgün Gökşenli */ -public class TurkishToLatinConversion { +public final class TurkishToLatinConversion { + private TurkishToLatinConversion() { + } /** * Main method diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/A_Star.java b/src/main/java/com/thealgorithms/datastructures/graphs/A_Star.java index 0da876148e43..b1af21eb6ff2 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/A_Star.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/A_Star.java @@ -9,7 +9,9 @@ import java.util.List; import java.util.PriorityQueue; -public class A_Star { +public final class A_Star { + private A_Star() { + } private static class Graph { diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java b/src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java index a4827d8881b3..6b41b658d5e2 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java @@ -14,7 +14,9 @@ * * Output : YES */ -public class BipartiteGrapfDFS { +public final class BipartiteGrapfDFS { + private BipartiteGrapfDFS() { + } private static boolean bipartite(int V, ArrayList> adj, int[] color, int node) { if (color[node] == -1) { diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java b/src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java index 9b6ff9010445..dadab2e5063c 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/ConnectedComponent.java @@ -107,7 +107,9 @@ public ArrayList depthFirstSearch(Node n, ArrayList visited) { } } -public class ConnectedComponent { +public final class ConnectedComponent { + private ConnectedComponent() { + } public static void main(String[] args) { Graph graphChars = new Graph<>(); diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/Cycles.java b/src/main/java/com/thealgorithms/datastructures/graphs/Cycles.java index 7995e0146190..06debf3dcb7f 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/Cycles.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/Cycles.java @@ -78,7 +78,9 @@ public void printAll() { } } -public class Cycles { +public final class Cycles { + private Cycles() { + } public static void main(String[] args) { Cycle c = new Cycle(); diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/Graphs.java b/src/main/java/com/thealgorithms/datastructures/graphs/Graphs.java index 01aa1085867b..3a13f6a698bd 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/Graphs.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/Graphs.java @@ -120,7 +120,9 @@ public String toString() { } } -public class Graphs { +public final class Graphs { + private Graphs() { + } public static void main(String[] args) { AdjacencyListGraph graph = new AdjacencyListGraph<>(); diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java b/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java index e978ddc1e764..145071890d76 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/KahnsAlgorithm.java @@ -130,7 +130,9 @@ ArrayList topSortOrder() { /** * A driver class that sorts a given graph in topological order. */ -public class KahnsAlgorithm { +public final class KahnsAlgorithm { + private KahnsAlgorithm() { + } public static void main(String[] args) { // Graph definition and initialization diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java b/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java index d595d53c1b61..c578053477d7 100644 --- a/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java +++ b/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java @@ -12,7 +12,9 @@ * * @author Unknown */ -public class MatrixGraphs { +public final class MatrixGraphs { + private MatrixGraphs() { + } public static void main(String[] args) { AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph(10); diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/Main.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/Main.java index d68e01284ddd..b4f0afc63729 100644 --- a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/Main.java +++ b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/Main.java @@ -2,7 +2,9 @@ import java.util.Scanner; -public class Main { +public final class Main { + private Main() { + } public static void main(String[] args) { int choice, key; diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java index 94d370b66976..f4e0f594de8f 100644 --- a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java +++ b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MainCuckooHashing.java @@ -2,7 +2,9 @@ import java.util.Scanner; -public class MainCuckooHashing { +public final class MainCuckooHashing { + private MainCuckooHashing() { + } public static void main(String[] args) { int choice, key; diff --git a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java index e3364b0e16fb..bfa5759a41b9 100644 --- a/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java +++ b/src/main/java/com/thealgorithms/datastructures/hashmap/hashing/MajorityElement.java @@ -8,7 +8,9 @@ This class finds the majority element(s) in an array of integers. A majority element is an element that appears more than or equal to n/2 times, where n is the length of the array. */ -public class MajorityElement { +public final class MajorityElement { + private MajorityElement() { + } /* This method returns the majority element(s) in the given array of integers. @param nums: an array of integers diff --git a/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java b/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java index 182c8f75fe55..38133ad3491f 100644 --- a/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java +++ b/src/main/java/com/thealgorithms/datastructures/lists/CreateAndDetectLoop.java @@ -2,7 +2,9 @@ import java.util.Scanner; -public class CreateAndDetectLoop { +public final class CreateAndDetectLoop { + private CreateAndDetectLoop() { + } /** * Prints the linked list. diff --git a/src/main/java/com/thealgorithms/datastructures/lists/MergeSortedArrayList.java b/src/main/java/com/thealgorithms/datastructures/lists/MergeSortedArrayList.java index 80b36b8e4ab1..99ab09f81c1c 100644 --- a/src/main/java/com/thealgorithms/datastructures/lists/MergeSortedArrayList.java +++ b/src/main/java/com/thealgorithms/datastructures/lists/MergeSortedArrayList.java @@ -6,7 +6,9 @@ /** * @author https://github.com/shellhub */ -public class MergeSortedArrayList { +public final class MergeSortedArrayList { + private MergeSortedArrayList() { + } public static void main(String[] args) { List listA = new ArrayList<>(); diff --git a/src/main/java/com/thealgorithms/datastructures/queues/Queues.java b/src/main/java/com/thealgorithms/datastructures/queues/Queues.java index a8fabf7b8859..2f364b7cbb6b 100644 --- a/src/main/java/com/thealgorithms/datastructures/queues/Queues.java +++ b/src/main/java/com/thealgorithms/datastructures/queues/Queues.java @@ -152,7 +152,9 @@ public String toString() { * * @author Unknown */ -public class Queues { +public final class Queues { + private Queues() { + } /** * Main method diff --git a/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java b/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java index c9d2ea05778b..0f9ef6f3a8e0 100644 --- a/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java +++ b/src/main/java/com/thealgorithms/datastructures/stacks/ReverseStack.java @@ -8,7 +8,9 @@ * * @author Ishika Agarwal, 2021 */ -public class ReverseStack { +public final class ReverseStack { + private ReverseStack() { + } public static void main(String[] args) { try (Scanner sc = new Scanner(System.in)) { diff --git a/src/main/java/com/thealgorithms/datastructures/stacks/StackOfLinkedList.java b/src/main/java/com/thealgorithms/datastructures/stacks/StackOfLinkedList.java index afe002fa3651..52b1c1d86c94 100644 --- a/src/main/java/com/thealgorithms/datastructures/stacks/StackOfLinkedList.java +++ b/src/main/java/com/thealgorithms/datastructures/stacks/StackOfLinkedList.java @@ -6,7 +6,9 @@ * @author Varun Upadhyay (https://github.com/varunu28) */ // An implementation of a Stack using a Linked List -class StackOfLinkedList { +final class StackOfLinkedList { + private StackOfLinkedList() { + } public static void main(String[] args) { LinkedListStack stack = new LinkedListStack(); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/BSTFromSortedArray.java b/src/main/java/com/thealgorithms/datastructures/trees/BSTFromSortedArray.java index 9066a6f231be..1962eaa0a106 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/BSTFromSortedArray.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/BSTFromSortedArray.java @@ -9,7 +9,9 @@ * left half recursively to create left subtree 3. Use the right half * recursively to create right subtree */ -public class BSTFromSortedArray { +public final class BSTFromSortedArray { + private BSTFromSortedArray() { + } public static Node createBST(int[] array) { if (array == null || array.length == 0) { return null; diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java b/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java index 6e1454f6859b..f238b5e9fe8d 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/CeilInBinarySearchTree.java @@ -42,7 +42,9 @@ * subtree. If left subtree returns a non-null value then that will be ceil * otherwise the root is ceil */ -public class CeilInBinarySearchTree { +public final class CeilInBinarySearchTree { + private CeilInBinarySearchTree() { + } public static Node getCeil(Node root, int key) { if (root == null) { diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CheckBinaryTreeIsValidBST.java b/src/main/java/com/thealgorithms/datastructures/trees/CheckBinaryTreeIsValidBST.java index c034452f7221..0c2b44d78d74 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/CheckBinaryTreeIsValidBST.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/CheckBinaryTreeIsValidBST.java @@ -8,7 +8,9 @@ * where 'min' and 'max' values represent the child nodes (left, right). * 2. The smallest possible node value is Integer.MIN_VALUE, the biggest - Integer.MAX_VALUE. */ -public class CheckBinaryTreeIsValidBST { +public final class CheckBinaryTreeIsValidBST { + private CheckBinaryTreeIsValidBST() { + } public static boolean isBST(BinaryTree.Node root) { return isBSTUtil(root, Integer.MIN_VALUE, Integer.MAX_VALUE); } diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CheckIfBinaryTreeBalanced.java b/src/main/java/com/thealgorithms/datastructures/trees/CheckIfBinaryTreeBalanced.java index 566536256558..9aa4d5a1fef2 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/CheckIfBinaryTreeBalanced.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/CheckIfBinaryTreeBalanced.java @@ -14,7 +14,9 @@ * * @author [Ian Cowan](Git-Ian Cowan) */ -public class CheckIfBinaryTreeBalanced { +public final class CheckIfBinaryTreeBalanced { + private CheckIfBinaryTreeBalanced() { + } /** * Recursive is BT balanced implementation * diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CheckTreeIsSymmetric.java b/src/main/java/com/thealgorithms/datastructures/trees/CheckTreeIsSymmetric.java index def455dde051..17d84bf11d54 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/CheckTreeIsSymmetric.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/CheckTreeIsSymmetric.java @@ -30,7 +30,9 @@ * * @author kumanoit on 10/10/22 IST 12:52 AM */ -public class CheckTreeIsSymmetric { +public final class CheckTreeIsSymmetric { + private CheckTreeIsSymmetric() { + } public static boolean isSymmetric(Node root) { if (root == null) { diff --git a/src/main/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorder.java b/src/main/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorder.java index 8303c658dfb8..04caa0b9e9d2 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorder.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/CreateBinaryTreeFromInorderPreorder.java @@ -17,7 +17,9 @@ * Complexity: Time: O(n) hashmap reduced iteration to find index in inorder * array Space: O(n) space taken by hashmap */ -public class CreateBinaryTreeFromInorderPreorder { +public final class CreateBinaryTreeFromInorderPreorder { + private CreateBinaryTreeFromInorderPreorder() { + } public static Node createTree(final Integer[] preorder, final Integer[] inorder) { if (preorder == null || inorder == null) { return null; diff --git a/src/main/java/com/thealgorithms/datastructures/trees/InorderTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/InorderTraversal.java index 6441375568ad..3bae17ed1bb8 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/InorderTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/InorderTraversal.java @@ -25,7 +25,9 @@ * * @author Albina Gimaletdinova on 21/02/2023 */ -public class InorderTraversal { +public final class InorderTraversal { + private InorderTraversal() { + } public static List recursiveInorder(BinaryTree.Node root) { List result = new ArrayList<>(); recursiveInorder(root, result); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/LCA.java b/src/main/java/com/thealgorithms/datastructures/trees/LCA.java index c8bac470d9b7..701077b0a549 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/LCA.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/LCA.java @@ -3,7 +3,9 @@ import java.util.ArrayList; import java.util.Scanner; -public class LCA { +public final class LCA { + private LCA() { + } private static final Scanner SCANNER = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java index e61085cf4def..f91aa303f66c 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/LevelOrderTraversal.java @@ -5,7 +5,9 @@ import java.util.List; import java.util.Queue; -public class LevelOrderTraversal { +public final class LevelOrderTraversal { + private LevelOrderTraversal() { + } public static List> traverse(BinaryTree.Node root) { if (root == null) { diff --git a/src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java index 3820345b95bf..50dc88381a24 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/PostOrderTraversal.java @@ -26,7 +26,9 @@ * * @author Albina Gimaletdinova on 21/02/2023 */ -public class PostOrderTraversal { +public final class PostOrderTraversal { + private PostOrderTraversal() { + } public static List recursivePostOrder(BinaryTree.Node root) { List result = new ArrayList<>(); recursivePostOrder(root, result); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/PreOrderTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/PreOrderTraversal.java index d0a5bc4ac3f0..6a0eef369407 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/PreOrderTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/PreOrderTraversal.java @@ -25,7 +25,9 @@ * * @author Albina Gimaletdinova on 17/02/2023 */ -public class PreOrderTraversal { +public final class PreOrderTraversal { + private PreOrderTraversal() { + } public static List recursivePreOrder(BinaryTree.Node root) { List result = new ArrayList<>(); recursivePreOrder(root, result); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java b/src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java index 7560e90cd008..e30a52929519 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/PrintTopViewofTree.java @@ -87,7 +87,9 @@ public void printTopView() { } // Driver class to test above methods -public class PrintTopViewofTree { +public final class PrintTopViewofTree { + private PrintTopViewofTree() { + } public static void main(String[] args) { /* Create following Binary Tree diff --git a/src/main/java/com/thealgorithms/datastructures/trees/SameTreesCheck.java b/src/main/java/com/thealgorithms/datastructures/trees/SameTreesCheck.java index aede2a23b544..883eadd1840a 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/SameTreesCheck.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/SameTreesCheck.java @@ -32,7 +32,9 @@ * * @author Albina Gimaletdinova on 13/01/2023 */ -public class SameTreesCheck { +public final class SameTreesCheck { + private SameTreesCheck() { + } public static boolean check(BinaryTree.Node p, BinaryTree.Node q) { if (p == null && q == null) { return true; diff --git a/src/main/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversal.java index a42b4370de68..63a75f6a2c9b 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/VerticalOrderTraversal.java @@ -20,7 +20,9 @@ the sequence will be : 4 2 7 1 5 9 3 8 6 10 */ -public class VerticalOrderTraversal { +public final class VerticalOrderTraversal { + private VerticalOrderTraversal() { + } /*Function that receives a root Node and prints the tree in Vertical Order.*/ diff --git a/src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java b/src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java index 50158b0fae0a..84fe0eb2c42a 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/ZigzagTraversal.java @@ -34,7 +34,9 @@ * * @author Albina Gimaletdinova on 11/01/2023 */ -public class ZigzagTraversal { +public final class ZigzagTraversal { + private ZigzagTraversal() { + } public static List> traverse(BinaryTree.Node root) { if (root == null) { return List.of(); diff --git a/src/main/java/com/thealgorithms/datastructures/trees/nearestRightKey.java b/src/main/java/com/thealgorithms/datastructures/trees/nearestRightKey.java index dd6df1481c99..797e5e4d56b8 100644 --- a/src/main/java/com/thealgorithms/datastructures/trees/nearestRightKey.java +++ b/src/main/java/com/thealgorithms/datastructures/trees/nearestRightKey.java @@ -3,7 +3,9 @@ import java.util.Scanner; import java.util.concurrent.ThreadLocalRandom; -class Main { +final class NearestRightKey { + private NearestRightKey() { + } public static void main(String[] args) { NRKTree root = BuildTree(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/BoardPath.java b/src/main/java/com/thealgorithms/dynamicprogramming/BoardPath.java index 7deb81448b55..b041cfc478d6 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/BoardPath.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/BoardPath.java @@ -25,7 +25,9 @@ */ -public class BoardPath { +public final class BoardPath { + private BoardPath() { + } public static long startTime; public static long endTime; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/BoundaryFill.java b/src/main/java/com/thealgorithms/dynamicprogramming/BoundaryFill.java index 52d7bffa4980..7fa4e24383a8 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/BoundaryFill.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/BoundaryFill.java @@ -4,7 +4,9 @@ * Java program for Boundary fill algorithm. * @author Akshay Dubey (https://github.com/itsAkshayDubey) */ -public class BoundaryFill { +public final class BoundaryFill { + private BoundaryFill() { + } /** * Get the color at the given co-odrinates of a 2D image diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/BruteForceKnapsack.java b/src/main/java/com/thealgorithms/dynamicprogramming/BruteForceKnapsack.java index 77d997fc2adc..5aba97eea1d8 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/BruteForceKnapsack.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/BruteForceKnapsack.java @@ -2,7 +2,9 @@ /* A Naive recursive implementation of 0-1 Knapsack problem */ -public class BruteForceKnapsack { +public final class BruteForceKnapsack { + private BruteForceKnapsack() { + } // Returns the maximum value that // can be put in a knapsack of // capacity W diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/CatalanNumber.java b/src/main/java/com/thealgorithms/dynamicprogramming/CatalanNumber.java index 5db7d39f1d99..8658bca3df52 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/CatalanNumber.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/CatalanNumber.java @@ -10,7 +10,9 @@ */ import java.util.Scanner; -public class CatalanNumber { +public final class CatalanNumber { + private CatalanNumber() { + } /** * This method finds the nth Catalan number diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/ClimbingStairs.java b/src/main/java/com/thealgorithms/dynamicprogramming/ClimbingStairs.java index 58ba1351109c..d79ed3c23e13 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/ClimbingStairs.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/ClimbingStairs.java @@ -5,7 +5,9 @@ Link : https://medium.com/analytics-vidhya/leetcode-q70-climbing-stairs-easy-444a4aae54e8 */ -public class ClimbingStairs { +public final class ClimbingStairs { + private ClimbingStairs() { + } public static int numberOfWays(int n) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java b/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java index b5be0b2660bf..bcd8b94a89ba 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/CoinChange.java @@ -3,7 +3,9 @@ /** * @author Varun Upadhyay (https://github.com/varunu28) */ -public class CoinChange { +public final class CoinChange { + private CoinChange() { + } // Driver Program public static void main(String[] args) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/CountFriendsPairing.java b/src/main/java/com/thealgorithms/dynamicprogramming/CountFriendsPairing.java index e18725405394..8c70c9c3fada 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/CountFriendsPairing.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/CountFriendsPairing.java @@ -15,7 +15,9 @@ package com.thealgorithms.dynamicprogramming; -public class CountFriendsPairing { +public final class CountFriendsPairing { + private CountFriendsPairing() { + } public static boolean countFriendsPairing(int n, int[] a) { int[] dp = new int[n + 1]; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java b/src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java index 84f9cf6a83d8..e1be3ead5895 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java @@ -13,7 +13,9 @@ And it can be done using Dynamic Programming(DP). // Code ----> // Java program to find number of ways to get sum 'x' with 'n' // dice where every dice has 'm' faces -class DP { +final class DP { + private DP() { + } /* The main function that returns the number of ways to get sum 'x' with 'n' dice and 'm' with m * faces. */ diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java b/src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java index 68877811092e..7a7b0f006b57 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/EditDistance.java @@ -24,7 +24,9 @@ */ import java.util.Scanner; -public class EditDistance { +public final class EditDistance { + private EditDistance() { + } public static int minDistance(String word1, String word2) { int len1 = word1.length(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/EggDropping.java b/src/main/java/com/thealgorithms/dynamicprogramming/EggDropping.java index ef1ff49465f3..c50522421d47 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/EggDropping.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/EggDropping.java @@ -3,7 +3,9 @@ /** * DynamicProgramming solution for the Egg Dropping Puzzle */ -public class EggDropping { +public final class EggDropping { + private EggDropping() { + } // min trials with n eggs and m floors public static int minTrials(int n, int m) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java b/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java index 81dd504ed791..2d768df55a7a 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/Fibonacci.java @@ -7,7 +7,9 @@ /** * @author Varun Upadhyay (https://github.com/varunu28) */ -public class Fibonacci { +public final class Fibonacci { + private Fibonacci() { + } private static final Map CACHE = new HashMap<>(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/FordFulkerson.java b/src/main/java/com/thealgorithms/dynamicprogramming/FordFulkerson.java index 63ec477c4590..9e1516ec3570 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/FordFulkerson.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/FordFulkerson.java @@ -4,7 +4,9 @@ import java.util.Queue; import java.util.Vector; -public class FordFulkerson { +public final class FordFulkerson { + private FordFulkerson() { + } static final int INF = 987654321; // edges diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/KadaneAlgorithm.java b/src/main/java/com/thealgorithms/dynamicprogramming/KadaneAlgorithm.java index 51cd6e50ea43..028c06d38dbd 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/KadaneAlgorithm.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/KadaneAlgorithm.java @@ -6,7 +6,9 @@ /** Program description - To find the maximum subarray sum */ package com.thealgorithms.dynamicprogramming; -public class KadaneAlgorithm { +public final class KadaneAlgorithm { + private KadaneAlgorithm() { + } public static boolean max_Sum(int[] a, int predicted_answer) { int sum = a[0], running_sum = 0; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestAlternatingSubsequence.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestAlternatingSubsequence.java index 5b508e036ae3..c5b7ea2b9a18 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestAlternatingSubsequence.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestAlternatingSubsequence.java @@ -11,7 +11,9 @@ x1 < x2 > x3 < x4 > x5 < …. xn or x1 > x2 < x3 > x4 < x5 > …. xn */ -public class LongestAlternatingSubsequence { +public final class LongestAlternatingSubsequence { + private LongestAlternatingSubsequence() { + } /* Function to return longest alternating subsequence length*/ static int AlternatingLength(int[] arr, int n) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java index 72fbc89397c0..bf43aab489c9 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestCommonSubsequence.java @@ -1,6 +1,8 @@ package com.thealgorithms.dynamicprogramming; -class LongestCommonSubsequence { +final class LongestCommonSubsequence { + private LongestCommonSubsequence() { + } public static String getLCS(String str1, String str2) { // At least one string is null diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java index a0882007dfbd..9457f0bec7e1 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestIncreasingSubsequence.java @@ -5,7 +5,9 @@ /** * @author Afrizal Fikri (https://github.com/icalF) */ -public class LongestIncreasingSubsequence { +public final class LongestIncreasingSubsequence { + private LongestIncreasingSubsequence() { + } public static void main(String[] args) { Scanner sc = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubsequence.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubsequence.java index c40d91100f30..9dfc6883b16a 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubsequence.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubsequence.java @@ -4,7 +4,9 @@ * Algorithm explanation * https://www.educative.io/edpresso/longest-palindromic-subsequence-algorithm */ -public class LongestPalindromicSubsequence { +public final class LongestPalindromicSubsequence { + private LongestPalindromicSubsequence() { + } public static void main(String[] args) { String a = "BBABCBCAB"; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubstring.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubstring.java index 0704272963fd..489adcca66ed 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubstring.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestPalindromicSubstring.java @@ -3,7 +3,9 @@ /* * Algorithm explanation https://leetcode.com/problems/longest-palindromic-substring/ */ -public class LongestPalindromicSubstring { +public final class LongestPalindromicSubstring { + private LongestPalindromicSubstring() { + } public static void main(String[] args) { String a = "babad"; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/LongestValidParentheses.java b/src/main/java/com/thealgorithms/dynamicprogramming/LongestValidParentheses.java index 5ceb85c984ca..02696bfca9c2 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/LongestValidParentheses.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/LongestValidParentheses.java @@ -7,7 +7,9 @@ * @author Libin Yang (https://github.com/yanglbme) * @since 2018/10/5 */ -public class LongestValidParentheses { +public final class LongestValidParentheses { + private LongestValidParentheses() { + } public static int getLongestValidParentheses(String s) { if (s == null || s.length() < 2) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainMultiplication.java b/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainMultiplication.java index 3a4b687aea2c..45568d21f295 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainMultiplication.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainMultiplication.java @@ -4,7 +4,9 @@ import java.util.Arrays; import java.util.Scanner; -public class MatrixChainMultiplication { +public final class MatrixChainMultiplication { + private MatrixChainMultiplication() { + } private static final Scanner SCANNER = new Scanner(System.in); private static final ArrayList MATRICES = new ArrayList<>(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainRecursiveTopDownMemoisation.java b/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainRecursiveTopDownMemoisation.java index ed9ccd8c0073..7d8015a56048 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainRecursiveTopDownMemoisation.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/MatrixChainRecursiveTopDownMemoisation.java @@ -6,7 +6,9 @@ // matrix Ai has dimension pi−1 ×pi // , fully parenthesize the product A1A2 ···An in a way that // minimizes the number of scalar multiplications. -public class MatrixChainRecursiveTopDownMemoisation { +public final class MatrixChainRecursiveTopDownMemoisation { + private MatrixChainRecursiveTopDownMemoisation() { + } static int Memoized_Matrix_Chain(int[] p) { int n = p.length; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/NewManShanksPrime.java b/src/main/java/com/thealgorithms/dynamicprogramming/NewManShanksPrime.java index 5aa0bf027c02..ff67500b0585 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/NewManShanksPrime.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/NewManShanksPrime.java @@ -8,7 +8,9 @@ package com.thealgorithms.dynamicprogramming; -public class NewManShanksPrime { +public final class NewManShanksPrime { + private NewManShanksPrime() { + } public static boolean nthManShanksPrime(int n, int expected_answer) { int[] a = new int[n + 1]; diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java b/src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java index 2ef7d61a355d..2c6643e39c47 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/PalindromicPartitioning.java @@ -17,7 +17,9 @@ * "aba | b | bbabb | ababa" * @author [Syed] (https://github.com/roeticvampire) */ -public class PalindromicPartitioning { +public final class PalindromicPartitioning { + private PalindromicPartitioning() { + } public static int minimalpartitions(String word) { int len = word.length(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/PartitionProblem.java b/src/main/java/com/thealgorithms/dynamicprogramming/PartitionProblem.java index efe5cc883daf..49c4a0a3a008 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/PartitionProblem.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/PartitionProblem.java @@ -18,7 +18,9 @@ import java.util.Arrays; -public class PartitionProblem { +public final class PartitionProblem { + private PartitionProblem() { + } /** * Test if a set of integers can be partitioned into two subsets such that the sum of elements diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java b/src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java index cc90e56f1b6d..43427457e307 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/RegexMatching.java @@ -12,7 +12,9 @@ * length of pat * */ -public class RegexMatching { +public final class RegexMatching { + private RegexMatching() { + } // Method 1: Using Recursion // Time Complexity=0(2^(N+M)) Space Complexity=Recursion Extra Space diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/RodCutting.java b/src/main/java/com/thealgorithms/dynamicprogramming/RodCutting.java index 4583aec2e1b4..f56fc4ff5641 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/RodCutting.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/RodCutting.java @@ -4,7 +4,9 @@ * A Dynamic Programming solution for the Rod cutting problem. * Returns the best obtainable price for a rod of length n and price[] as prices of different pieces. */ -public class RodCutting { +public final class RodCutting { + private RodCutting() { + } /** * This method calculates the maximum obtainable value for cutting a rod of length n diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java b/src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java index 78baaa32e1a4..68387b7d2ed7 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/ShortestCommonSupersequenceLength.java @@ -1,7 +1,9 @@ package com.thealgorithms.dynamicprogramming; // Java program to find length of the shortest supersequence -class ShortestSuperSequence { +final class ShortestSuperSequence { + private ShortestSuperSequence() { + } // Function to find length of the // shortest supersequence of X and Y. diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java b/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java index 33696947c008..087d9ac2c7e7 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java @@ -1,6 +1,8 @@ package com.thealgorithms.dynamicprogramming; -public class SubsetSum { +public final class SubsetSum { + private SubsetSum() { + } /** * Driver Code diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/SumOfSubset.java b/src/main/java/com/thealgorithms/dynamicprogramming/SumOfSubset.java index 622f8b146d96..a2e641095c9f 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/SumOfSubset.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/SumOfSubset.java @@ -1,6 +1,8 @@ package com.thealgorithms.dynamicprogramming; -public class SumOfSubset { +public final class SumOfSubset { + private SumOfSubset() { + } public static boolean subsetSum(int[] arr, int num, int Key) { if (Key == 0) { diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/Tribonacci.java b/src/main/java/com/thealgorithms/dynamicprogramming/Tribonacci.java index 99f9029009ab..6abd6b234195 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/Tribonacci.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/Tribonacci.java @@ -4,7 +4,9 @@ * The {@code Tribonacci} class provides a method to compute the n-th number in the Tribonacci sequence. * N-th Tribonacci Number - https://leetcode.com/problems/n-th-tribonacci-number/description/ */ -public class Tribonacci { +public final class Tribonacci { + private Tribonacci() { + } /** * Computes the n-th Tribonacci number. diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/WildcardMatching.java b/src/main/java/com/thealgorithms/dynamicprogramming/WildcardMatching.java index a938634cdfd2..8e8bf3cc6606 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/WildcardMatching.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/WildcardMatching.java @@ -14,7 +14,9 @@ package com.thealgorithms.dynamicprogramming; -public class WildcardMatching { +public final class WildcardMatching { + private WildcardMatching() { + } public static boolean isMatch(String text, String pattern) { int m = text.length(); diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/WineProblem.java b/src/main/java/com/thealgorithms/dynamicprogramming/WineProblem.java index b7eb029eaa71..6d7f0b8a8036 100644 --- a/src/main/java/com/thealgorithms/dynamicprogramming/WineProblem.java +++ b/src/main/java/com/thealgorithms/dynamicprogramming/WineProblem.java @@ -10,7 +10,9 @@ * shelf. You are not allowed to reorder. You have to find the maximum profit * */ -public class WineProblem { +public final class WineProblem { + private WineProblem() { + } // Method 1: Using Recursion // Time Complexity=0(2^N) Space Complexity=Recursion extra space diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/ActivitySelection.java b/src/main/java/com/thealgorithms/greedyalgorithms/ActivitySelection.java index 6909c564fe96..88fbc50129ca 100644 --- a/src/main/java/com/thealgorithms/greedyalgorithms/ActivitySelection.java +++ b/src/main/java/com/thealgorithms/greedyalgorithms/ActivitySelection.java @@ -6,7 +6,9 @@ // Problem Link: https://en.wikipedia.org/wiki/Activity_selection_problem -public class ActivitySelection { +public final class ActivitySelection { + private ActivitySelection() { + } // Function to perform activity selection public static ArrayList activitySelection(int[] startTimes, int[] endTimes) { int n = startTimes.length; diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java b/src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java index 560adf8eb84c..8054581d21d7 100644 --- a/src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java +++ b/src/main/java/com/thealgorithms/greedyalgorithms/CoinChange.java @@ -6,7 +6,9 @@ // Problem Link : https://en.wikipedia.org/wiki/Change-making_problem -public class CoinChange { +public final class CoinChange { + private CoinChange() { + } // Function to solve the coin change problem public static ArrayList coinChangeProblem(int amount) { // Define an array of coin denominations in descending order diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java b/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java index d13cafb0978a..082bd9c68b32 100644 --- a/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java +++ b/src/main/java/com/thealgorithms/greedyalgorithms/FractionalKnapsack.java @@ -5,7 +5,9 @@ // Problem Link: https://en.wikipedia.org/wiki/Continuous_knapsack_problem -public class FractionalKnapsack { +public final class FractionalKnapsack { + private FractionalKnapsack() { + } // Function to perform fractional knapsack public static int fractionalKnapsack(int[] weight, int[] value, int capacity) { // Create a 2D array to store item indices and their value-to-weight ratios. diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/JobSequencing.java b/src/main/java/com/thealgorithms/greedyalgorithms/JobSequencing.java index 113918263cd3..69d52530d709 100644 --- a/src/main/java/com/thealgorithms/greedyalgorithms/JobSequencing.java +++ b/src/main/java/com/thealgorithms/greedyalgorithms/JobSequencing.java @@ -5,7 +5,9 @@ // Problem Link: https://en.wikipedia.org/wiki/Job-shop_scheduling -public class JobSequencing { +public final class JobSequencing { + private JobSequencing() { + } // Define a Job class that implements Comparable for sorting by profit in descending order static class Job implements Comparable { diff --git a/src/main/java/com/thealgorithms/greedyalgorithms/MinimizingLateness.java b/src/main/java/com/thealgorithms/greedyalgorithms/MinimizingLateness.java index 938ae79bb625..c7f219ef3eab 100644 --- a/src/main/java/com/thealgorithms/greedyalgorithms/MinimizingLateness.java +++ b/src/main/java/com/thealgorithms/greedyalgorithms/MinimizingLateness.java @@ -2,7 +2,9 @@ import java.util.Arrays; -public class MinimizingLateness { +public final class MinimizingLateness { + private MinimizingLateness() { + } public static class Job { String jobName; diff --git a/src/main/java/com/thealgorithms/maths/AbsoluteMax.java b/src/main/java/com/thealgorithms/maths/AbsoluteMax.java index 64338297e399..d0c3db3790a3 100644 --- a/src/main/java/com/thealgorithms/maths/AbsoluteMax.java +++ b/src/main/java/com/thealgorithms/maths/AbsoluteMax.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class AbsoluteMax { +public final class AbsoluteMax { + private AbsoluteMax() { + } /** * Finds the absolute maximum value among the given numbers. diff --git a/src/main/java/com/thealgorithms/maths/AbsoluteMin.java b/src/main/java/com/thealgorithms/maths/AbsoluteMin.java index 97d37dd9294a..1ffe6d2e81bc 100644 --- a/src/main/java/com/thealgorithms/maths/AbsoluteMin.java +++ b/src/main/java/com/thealgorithms/maths/AbsoluteMin.java @@ -2,7 +2,9 @@ import java.util.Arrays; -public class AbsoluteMin { +public final class AbsoluteMin { + private AbsoluteMin() { + } /** * Compares the numbers given as arguments to get the absolute min value. diff --git a/src/main/java/com/thealgorithms/maths/AbsoluteValue.java b/src/main/java/com/thealgorithms/maths/AbsoluteValue.java index 607413641392..b9279d5a244a 100644 --- a/src/main/java/com/thealgorithms/maths/AbsoluteValue.java +++ b/src/main/java/com/thealgorithms/maths/AbsoluteValue.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class AbsoluteValue { +public final class AbsoluteValue { + private AbsoluteValue() { + } /** * Returns the absolute value of a number. diff --git a/src/main/java/com/thealgorithms/maths/AliquotSum.java b/src/main/java/com/thealgorithms/maths/AliquotSum.java index daf02f14749f..5a5555777425 100644 --- a/src/main/java/com/thealgorithms/maths/AliquotSum.java +++ b/src/main/java/com/thealgorithms/maths/AliquotSum.java @@ -9,7 +9,9 @@ * are not equal to 15) are 1, 3 and 5, so the aliquot sum of 15 is 9 i.e. (1 + * 3 + 5). Wikipedia: https://en.wikipedia.org/wiki/Aliquot_sum */ -public class AliquotSum { +public final class AliquotSum { + private AliquotSum() { + } /** * Finds the aliquot sum of an integer number. diff --git a/src/main/java/com/thealgorithms/maths/AmicableNumber.java b/src/main/java/com/thealgorithms/maths/AmicableNumber.java index 23c90888ec5d..b30831bfdc58 100644 --- a/src/main/java/com/thealgorithms/maths/AmicableNumber.java +++ b/src/main/java/com/thealgorithms/maths/AmicableNumber.java @@ -19,7 +19,9 @@ * 220 is divisible by {1,2,4,5,10,11,20,22,44,55,110} <-SUM = 284 * 284 is divisible by {1,2,4,71,142} <-SUM = 220. */ -public class AmicableNumber { +public final class AmicableNumber { + private AmicableNumber() { + } /** * Finds all the amicable numbers in a given range. * diff --git a/src/main/java/com/thealgorithms/maths/Area.java b/src/main/java/com/thealgorithms/maths/Area.java index 43d35eea47b9..7a06fd5e5fa0 100644 --- a/src/main/java/com/thealgorithms/maths/Area.java +++ b/src/main/java/com/thealgorithms/maths/Area.java @@ -3,7 +3,9 @@ /** * Find the area of various geometric shapes */ -public class Area { +public final class Area { + private Area() { + } /** * String of IllegalArgumentException for radius diff --git a/src/main/java/com/thealgorithms/maths/AutoCorrelation.java b/src/main/java/com/thealgorithms/maths/AutoCorrelation.java index 5b38235bcd01..344a1271e11c 100644 --- a/src/main/java/com/thealgorithms/maths/AutoCorrelation.java +++ b/src/main/java/com/thealgorithms/maths/AutoCorrelation.java @@ -7,7 +7,9 @@ * @version 2.0 */ -public class AutoCorrelation { +public final class AutoCorrelation { + private AutoCorrelation() { + } /** * Discrete linear auto-correlation function. diff --git a/src/main/java/com/thealgorithms/maths/AutomorphicNumber.java b/src/main/java/com/thealgorithms/maths/AutomorphicNumber.java index 1e5eb32f6e8b..d9dd82c7bbe2 100644 --- a/src/main/java/com/thealgorithms/maths/AutomorphicNumber.java +++ b/src/main/java/com/thealgorithms/maths/AutomorphicNumber.java @@ -10,7 +10,9 @@ import java.math.BigInteger; -public class AutomorphicNumber { +public final class AutomorphicNumber { + private AutomorphicNumber() { + } /** * A function to check if a number is Automorphic number or not diff --git a/src/main/java/com/thealgorithms/maths/Average.java b/src/main/java/com/thealgorithms/maths/Average.java index 903afbafe35f..1c632cf0a65e 100644 --- a/src/main/java/com/thealgorithms/maths/Average.java +++ b/src/main/java/com/thealgorithms/maths/Average.java @@ -3,7 +3,9 @@ /** * Calculate average of a list of numbers */ -public class Average { +public final class Average { + private Average() { + } /** * Calculate average of a list of numbers diff --git a/src/main/java/com/thealgorithms/maths/BinaryPow.java b/src/main/java/com/thealgorithms/maths/BinaryPow.java index d431d58b91b1..1550376782b1 100644 --- a/src/main/java/com/thealgorithms/maths/BinaryPow.java +++ b/src/main/java/com/thealgorithms/maths/BinaryPow.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class BinaryPow { +public final class BinaryPow { + private BinaryPow() { + } /** * Calculate a^p using binary exponentiation diff --git a/src/main/java/com/thealgorithms/maths/BinomialCoefficient.java b/src/main/java/com/thealgorithms/maths/BinomialCoefficient.java index 4009b79e5057..faec049b08a7 100644 --- a/src/main/java/com/thealgorithms/maths/BinomialCoefficient.java +++ b/src/main/java/com/thealgorithms/maths/BinomialCoefficient.java @@ -10,7 +10,9 @@ * * */ -public class BinomialCoefficient { +public final class BinomialCoefficient { + private BinomialCoefficient() { + } /** * This method returns the number of ways in which k objects can be chosen from n objects diff --git a/src/main/java/com/thealgorithms/maths/Ceil.java b/src/main/java/com/thealgorithms/maths/Ceil.java index f9b570fca76a..aacb9d969950 100644 --- a/src/main/java/com/thealgorithms/maths/Ceil.java +++ b/src/main/java/com/thealgorithms/maths/Ceil.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class Ceil { +public final class Ceil { + private Ceil() { + } /** * Returns the smallest (closest to negative infinity) diff --git a/src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java b/src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java index f01e029b42a6..f7010acf452d 100644 --- a/src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java +++ b/src/main/java/com/thealgorithms/maths/CircularConvolutionFFT.java @@ -9,7 +9,9 @@ * @author Ioannis Karavitsis * @version 1.0 */ -public class CircularConvolutionFFT { +public final class CircularConvolutionFFT { + private CircularConvolutionFFT() { + } /** * This method pads the signal with zeros until it reaches the new size. diff --git a/src/main/java/com/thealgorithms/maths/Combinations.java b/src/main/java/com/thealgorithms/maths/Combinations.java index 68d653229fa9..2b4a78613190 100644 --- a/src/main/java/com/thealgorithms/maths/Combinations.java +++ b/src/main/java/com/thealgorithms/maths/Combinations.java @@ -3,7 +3,9 @@ /** * @see Combination */ -public class Combinations { +public final class Combinations { + private Combinations() { + } /** * Calculate of factorial diff --git a/src/main/java/com/thealgorithms/maths/Convolution.java b/src/main/java/com/thealgorithms/maths/Convolution.java index cafb36f7a2b1..4dd4eb3e99f5 100644 --- a/src/main/java/com/thealgorithms/maths/Convolution.java +++ b/src/main/java/com/thealgorithms/maths/Convolution.java @@ -6,7 +6,9 @@ * @author Ioannis Karavitsis * @version 1.0 */ -public class Convolution { +public final class Convolution { + private Convolution() { + } /** * Discrete linear convolution function. Both input signals and the output diff --git a/src/main/java/com/thealgorithms/maths/ConvolutionFFT.java b/src/main/java/com/thealgorithms/maths/ConvolutionFFT.java index b761092ac70f..ce35b02ca13b 100644 --- a/src/main/java/com/thealgorithms/maths/ConvolutionFFT.java +++ b/src/main/java/com/thealgorithms/maths/ConvolutionFFT.java @@ -9,7 +9,9 @@ * @author Ioannis Karavitsis * @version 1.0 */ -public class ConvolutionFFT { +public final class ConvolutionFFT { + private ConvolutionFFT() { + } /** * This method pads the signal with zeros until it reaches the new size. diff --git a/src/main/java/com/thealgorithms/maths/CrossCorrelation.java b/src/main/java/com/thealgorithms/maths/CrossCorrelation.java index 080e4ab7e74b..d3a2303502fa 100644 --- a/src/main/java/com/thealgorithms/maths/CrossCorrelation.java +++ b/src/main/java/com/thealgorithms/maths/CrossCorrelation.java @@ -7,7 +7,9 @@ * @version 1.0 */ -public class CrossCorrelation { +public final class CrossCorrelation { + private CrossCorrelation() { + } /** * Discrete linear cross-correlation function. diff --git a/src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java b/src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java index 53661511aed5..7f96af388611 100644 --- a/src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java +++ b/src/main/java/com/thealgorithms/maths/DeterminantOfMatrix.java @@ -6,7 +6,9 @@ * @author Ojasva Jain * Determinant of a Matrix Wikipedia link: https://en.wikipedia.org/wiki/Determinant */ -public class DeterminantOfMatrix { +public final class DeterminantOfMatrix { + private DeterminantOfMatrix() { + } // Determinant calculator //@return determinant of the input matrix diff --git a/src/main/java/com/thealgorithms/maths/DigitalRoot.java b/src/main/java/com/thealgorithms/maths/DigitalRoot.java index 9eeb4a65f2ae..84b33f34c393 100644 --- a/src/main/java/com/thealgorithms/maths/DigitalRoot.java +++ b/src/main/java/com/thealgorithms/maths/DigitalRoot.java @@ -40,7 +40,9 @@ */ package com.thealgorithms.maths; -class DigitalRoot { +final class DigitalRoot { + private DigitalRoot() { + } public static int digitalRoot(int n) { if (single(n) <= 9) { // If n is already single digit than simply call single method and diff --git a/src/main/java/com/thealgorithms/maths/DistanceFormula.java b/src/main/java/com/thealgorithms/maths/DistanceFormula.java index 6efc2fbdff5d..f7e2c7629551 100644 --- a/src/main/java/com/thealgorithms/maths/DistanceFormula.java +++ b/src/main/java/com/thealgorithms/maths/DistanceFormula.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class DistanceFormula { +public final class DistanceFormula { + private DistanceFormula() { + } public static double euclideanDistance(double x1, double y1, double x2, double y2) { double dX = Math.pow(x2 - x1, 2); diff --git a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java index 3bb56c5ccdb7..c8c8820d3a5f 100644 --- a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java +++ b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java @@ -6,7 +6,9 @@ */ package com.thealgorithms.maths; -public class DudeneyNumber { +public final class DudeneyNumber { + private DudeneyNumber() { + } // returns True if the number is a Dudeney number and False if it is not a Dudeney number. public static boolean isDudeney(int n) { diff --git a/src/main/java/com/thealgorithms/maths/EulerMethod.java b/src/main/java/com/thealgorithms/maths/EulerMethod.java index 40e654626a23..3663b6c534aa 100644 --- a/src/main/java/com/thealgorithms/maths/EulerMethod.java +++ b/src/main/java/com/thealgorithms/maths/EulerMethod.java @@ -15,7 +15,9 @@ * https://en.wikipedia.org/wiki/Euler_method ) (see also: * https://www.geeksforgeeks.org/euler-method-solving-differential-equation/ ) */ -public class EulerMethod { +public final class EulerMethod { + private EulerMethod() { + } /** * Illustrates how the algorithm is used in 3 examples and prints the diff --git a/src/main/java/com/thealgorithms/maths/FFT.java b/src/main/java/com/thealgorithms/maths/FFT.java index f745917749e5..8f21254794c0 100644 --- a/src/main/java/com/thealgorithms/maths/FFT.java +++ b/src/main/java/com/thealgorithms/maths/FFT.java @@ -10,7 +10,9 @@ * @author Ioannis Karavitsis * @version 1.0 */ -public class FFT { +public final class FFT { + private FFT() { + } /** * This class represents a complex number and has methods for basic diff --git a/src/main/java/com/thealgorithms/maths/FFTBluestein.java b/src/main/java/com/thealgorithms/maths/FFTBluestein.java index cd698b62570a..ca9517eeb673 100644 --- a/src/main/java/com/thealgorithms/maths/FFTBluestein.java +++ b/src/main/java/com/thealgorithms/maths/FFTBluestein.java @@ -9,7 +9,9 @@ * @author Ioannis Karavitsis * @version 1.0 */ -public class FFTBluestein { +public final class FFTBluestein { + private FFTBluestein() { + } /** * Bluestein's FFT Algorithm. diff --git a/src/main/java/com/thealgorithms/maths/FastInverseSqrt.java b/src/main/java/com/thealgorithms/maths/FastInverseSqrt.java index 886337478d01..a0dbfb1f70a4 100644 --- a/src/main/java/com/thealgorithms/maths/FastInverseSqrt.java +++ b/src/main/java/com/thealgorithms/maths/FastInverseSqrt.java @@ -9,7 +9,9 @@ package com.thealgorithms.maths; -public class FastInverseSqrt { +public final class FastInverseSqrt { + private FastInverseSqrt() { + } public static boolean inverseSqrt(float number) { float x = number; diff --git a/src/main/java/com/thealgorithms/maths/FibonacciJavaStreams.java b/src/main/java/com/thealgorithms/maths/FibonacciJavaStreams.java index a9663d39a988..72bae57c27b0 100644 --- a/src/main/java/com/thealgorithms/maths/FibonacciJavaStreams.java +++ b/src/main/java/com/thealgorithms/maths/FibonacciJavaStreams.java @@ -9,7 +9,9 @@ * @author: caos321 * @date: 14 October 2021 (Thursday) */ -public class FibonacciJavaStreams { +public final class FibonacciJavaStreams { + private FibonacciJavaStreams() { + } public static Optional calculate(final BigDecimal index) { if (index == null || index.compareTo(BigDecimal.ZERO) < 0) { diff --git a/src/main/java/com/thealgorithms/maths/FibonacciNumberCheck.java b/src/main/java/com/thealgorithms/maths/FibonacciNumberCheck.java index 937786546fc3..781275d3130d 100644 --- a/src/main/java/com/thealgorithms/maths/FibonacciNumberCheck.java +++ b/src/main/java/com/thealgorithms/maths/FibonacciNumberCheck.java @@ -5,7 +5,9 @@ * This code checks Fibonacci Numbers up to 45th number. * Other checks fail because of 'long'-type overflow. */ -public class FibonacciNumberCheck { +public final class FibonacciNumberCheck { + private FibonacciNumberCheck() { + } /** * Check if a number is perfect square number * diff --git a/src/main/java/com/thealgorithms/maths/FindKthNumber.java b/src/main/java/com/thealgorithms/maths/FindKthNumber.java index 0608cd0f1926..bf7a4985f7f6 100644 --- a/src/main/java/com/thealgorithms/maths/FindKthNumber.java +++ b/src/main/java/com/thealgorithms/maths/FindKthNumber.java @@ -6,7 +6,9 @@ /** * use quick sort algorithm to get kth largest or kth smallest element in given array */ -public class FindKthNumber { +public final class FindKthNumber { + private FindKthNumber() { + } private static final Random RANDOM = new Random(); diff --git a/src/main/java/com/thealgorithms/maths/FrizzyNumber.java b/src/main/java/com/thealgorithms/maths/FrizzyNumber.java index 3b1ff5fde3b3..3ae5e021df1b 100644 --- a/src/main/java/com/thealgorithms/maths/FrizzyNumber.java +++ b/src/main/java/com/thealgorithms/maths/FrizzyNumber.java @@ -7,7 +7,9 @@ package com.thealgorithms.maths; -public class FrizzyNumber { +public final class FrizzyNumber { + private FrizzyNumber() { + } /** * Returns the n-th number that is a sum of powers diff --git a/src/main/java/com/thealgorithms/maths/GCD.java b/src/main/java/com/thealgorithms/maths/GCD.java index 0f3125bde209..5156e4ac881d 100644 --- a/src/main/java/com/thealgorithms/maths/GCD.java +++ b/src/main/java/com/thealgorithms/maths/GCD.java @@ -6,7 +6,9 @@ * * @author Oskar Enmalm 3/10/17 */ -public class GCD { +public final class GCD { + private GCD() { + } /** * get the greatest common divisor diff --git a/src/main/java/com/thealgorithms/maths/GCDRecursion.java b/src/main/java/com/thealgorithms/maths/GCDRecursion.java index 05e44f941ac7..e95ce97c8a04 100644 --- a/src/main/java/com/thealgorithms/maths/GCDRecursion.java +++ b/src/main/java/com/thealgorithms/maths/GCDRecursion.java @@ -3,7 +3,9 @@ /** * @author https://github.com/shellhub/ */ -public class GCDRecursion { +public final class GCDRecursion { + private GCDRecursion() { + } public static void main(String[] args) { System.out.println(gcd(20, 15)); diff --git a/src/main/java/com/thealgorithms/maths/Gaussian.java b/src/main/java/com/thealgorithms/maths/Gaussian.java index 442c51e9d32d..5591bfd1068c 100644 --- a/src/main/java/com/thealgorithms/maths/Gaussian.java +++ b/src/main/java/com/thealgorithms/maths/Gaussian.java @@ -2,7 +2,9 @@ import java.util.ArrayList; -public class Gaussian { +public final class Gaussian { + private Gaussian() { + } public static ArrayList gaussian(int mat_size, ArrayList matrix) { ArrayList answerArray = new ArrayList(); diff --git a/src/main/java/com/thealgorithms/maths/HarshadNumber.java b/src/main/java/com/thealgorithms/maths/HarshadNumber.java index 4778dc81b664..e063c860ca6a 100644 --- a/src/main/java/com/thealgorithms/maths/HarshadNumber.java +++ b/src/main/java/com/thealgorithms/maths/HarshadNumber.java @@ -2,7 +2,9 @@ // Wikipedia for Harshad Number : https://en.wikipedia.org/wiki/Harshad_number -public class HarshadNumber { +public final class HarshadNumber { + private HarshadNumber() { + } /** * A function to check if a number is Harshad number or not diff --git a/src/main/java/com/thealgorithms/maths/JosephusProblem.java b/src/main/java/com/thealgorithms/maths/JosephusProblem.java index b878eff2b291..7d19623b3ed0 100644 --- a/src/main/java/com/thealgorithms/maths/JosephusProblem.java +++ b/src/main/java/com/thealgorithms/maths/JosephusProblem.java @@ -20,7 +20,9 @@ @author Kunal */ -public class JosephusProblem { +public final class JosephusProblem { + private JosephusProblem() { + } /** * Find the Winner of the Circular Game. diff --git a/src/main/java/com/thealgorithms/maths/JugglerSequence.java b/src/main/java/com/thealgorithms/maths/JugglerSequence.java index 216098fc926f..702310a1f295 100644 --- a/src/main/java/com/thealgorithms/maths/JugglerSequence.java +++ b/src/main/java/com/thealgorithms/maths/JugglerSequence.java @@ -11,7 +11,9 @@ * * */ -public class JugglerSequence { +public final class JugglerSequence { + private JugglerSequence() { + } /** * This method prints juggler sequence starting with the number in the parameter diff --git a/src/main/java/com/thealgorithms/maths/KaprekarNumbers.java b/src/main/java/com/thealgorithms/maths/KaprekarNumbers.java index e46a3ac8374d..f025f86682a2 100644 --- a/src/main/java/com/thealgorithms/maths/KaprekarNumbers.java +++ b/src/main/java/com/thealgorithms/maths/KaprekarNumbers.java @@ -4,7 +4,9 @@ import java.util.ArrayList; import java.util.List; -public class KaprekarNumbers { +public final class KaprekarNumbers { + private KaprekarNumbers() { + } /* This program demonstrates if a given number is Kaprekar Number or not. Kaprekar Number: A Kaprekar number is an n-digit number which its square can be split into diff --git a/src/main/java/com/thealgorithms/maths/KeithNumber.java b/src/main/java/com/thealgorithms/maths/KeithNumber.java index fdabbc16685d..194c4ba3c5bd 100644 --- a/src/main/java/com/thealgorithms/maths/KeithNumber.java +++ b/src/main/java/com/thealgorithms/maths/KeithNumber.java @@ -4,7 +4,9 @@ import java.util.Collections; import java.util.Scanner; -class KeithNumber { +final class KeithNumber { + private KeithNumber() { + } // user-defined function that checks if the given number is Keith or not static boolean isKeith(int x) { diff --git a/src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java b/src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java index f152b0666a10..f5ff50337bc7 100644 --- a/src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java +++ b/src/main/java/com/thealgorithms/maths/KrishnamurthyNumber.java @@ -9,7 +9,9 @@ import java.io.IOException; import java.io.InputStreamReader; -public class KrishnamurthyNumber { +public final class KrishnamurthyNumber { + private KrishnamurthyNumber() { + } // returns True if the number is a Krishnamurthy number and False if it is not. diff --git a/src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java b/src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java index 66352568f96d..ae887470fa33 100644 --- a/src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java +++ b/src/main/java/com/thealgorithms/maths/LeastCommonMultiple.java @@ -9,7 +9,9 @@ * @author LauKinHoong */ -public class LeastCommonMultiple { +public final class LeastCommonMultiple { + private LeastCommonMultiple() { + } /** * Driver Code diff --git a/src/main/java/com/thealgorithms/maths/LeonardoNumber.java b/src/main/java/com/thealgorithms/maths/LeonardoNumber.java index 1ca5c8bd0fa6..bbeec052777f 100644 --- a/src/main/java/com/thealgorithms/maths/LeonardoNumber.java +++ b/src/main/java/com/thealgorithms/maths/LeonardoNumber.java @@ -3,7 +3,9 @@ /** * https://en.wikipedia.org/wiki/Leonardo_number */ -public class LeonardoNumber { +public final class LeonardoNumber { + private LeonardoNumber() { + } /** * Calculate nth Leonardo Number (1, 1, 3, 5, 9, 15, 25, 41, 67, 109, 177, ...) diff --git a/src/main/java/com/thealgorithms/maths/LinearDiophantineEquationsSolver.java b/src/main/java/com/thealgorithms/maths/LinearDiophantineEquationsSolver.java index 2d00cc5561e8..a50cfb218283 100644 --- a/src/main/java/com/thealgorithms/maths/LinearDiophantineEquationsSolver.java +++ b/src/main/java/com/thealgorithms/maths/LinearDiophantineEquationsSolver.java @@ -3,6 +3,8 @@ import java.util.Objects; public final class LinearDiophantineEquationsSolver { + private LinearDiophantineEquationsSolver() { + } public static void main(String[] args) { // 3x + 4y = 7 diff --git a/src/main/java/com/thealgorithms/maths/LiouvilleLambdaFunction.java b/src/main/java/com/thealgorithms/maths/LiouvilleLambdaFunction.java index 89acbf6a14e7..c0f55f5e3485 100644 --- a/src/main/java/com/thealgorithms/maths/LiouvilleLambdaFunction.java +++ b/src/main/java/com/thealgorithms/maths/LiouvilleLambdaFunction.java @@ -12,7 +12,9 @@ * * */ -public class LiouvilleLambdaFunction { +public final class LiouvilleLambdaFunction { + private LiouvilleLambdaFunction() { + } /** * This method returns λ(n) of given number n diff --git a/src/main/java/com/thealgorithms/maths/LongDivision.java b/src/main/java/com/thealgorithms/maths/LongDivision.java index b1c7b1901701..2191bf840a9b 100644 --- a/src/main/java/com/thealgorithms/maths/LongDivision.java +++ b/src/main/java/com/thealgorithms/maths/LongDivision.java @@ -8,7 +8,9 @@ package com.thealgorithms.maths; -public class LongDivision { +public final class LongDivision { + private LongDivision() { + } public static int divide(int dividend, int divisor) { long new_dividend_1 = dividend; long new_divisor_1 = divisor; diff --git a/src/main/java/com/thealgorithms/maths/LucasSeries.java b/src/main/java/com/thealgorithms/maths/LucasSeries.java index ebeb2715fe2d..e277c511f317 100644 --- a/src/main/java/com/thealgorithms/maths/LucasSeries.java +++ b/src/main/java/com/thealgorithms/maths/LucasSeries.java @@ -3,7 +3,9 @@ /** * https://en.wikipedia.org/wiki/Lucas_number */ -public class LucasSeries { +public final class LucasSeries { + private LucasSeries() { + } /** * Calculate nth number of Lucas Series(2, 1, 3, 4, 7, 11, 18, 29, 47, 76, diff --git a/src/main/java/com/thealgorithms/maths/MagicSquare.java b/src/main/java/com/thealgorithms/maths/MagicSquare.java index 6e9f88a5a0b9..7e0ff4da6da7 100644 --- a/src/main/java/com/thealgorithms/maths/MagicSquare.java +++ b/src/main/java/com/thealgorithms/maths/MagicSquare.java @@ -5,7 +5,9 @@ /*A magic square of order n is an arrangement of distinct n^2 integers,in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square contains the integers from 1 to n^2.*/ -public class MagicSquare { +public final class MagicSquare { + private MagicSquare() { + } public static void main(String[] args) { Scanner sc = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/maths/MatrixUtil.java b/src/main/java/com/thealgorithms/maths/MatrixUtil.java index f3d0efeacc45..0759853d61a9 100644 --- a/src/main/java/com/thealgorithms/maths/MatrixUtil.java +++ b/src/main/java/com/thealgorithms/maths/MatrixUtil.java @@ -11,7 +11,9 @@ * @author: caos321 * @date: 31 October 2021 (Sunday) */ -public class MatrixUtil { +public final class MatrixUtil { + private MatrixUtil() { + } public static boolean isValid(final BigDecimal[][] matrix) { return matrix != null && matrix.length > 0 && matrix[0].length > 0; diff --git a/src/main/java/com/thealgorithms/maths/Median.java b/src/main/java/com/thealgorithms/maths/Median.java index 89bc42254d34..e4daec8fc11a 100644 --- a/src/main/java/com/thealgorithms/maths/Median.java +++ b/src/main/java/com/thealgorithms/maths/Median.java @@ -5,7 +5,9 @@ /** * Wikipedia: https://en.wikipedia.org/wiki/Median */ -public class Median { +public final class Median { + private Median() { + } /** * Calculate average median diff --git a/src/main/java/com/thealgorithms/maths/MillerRabinPrimalityCheck.java b/src/main/java/com/thealgorithms/maths/MillerRabinPrimalityCheck.java index ed4f325b0710..e25836f713a9 100644 --- a/src/main/java/com/thealgorithms/maths/MillerRabinPrimalityCheck.java +++ b/src/main/java/com/thealgorithms/maths/MillerRabinPrimalityCheck.java @@ -2,7 +2,9 @@ import java.util.Random; -public class MillerRabinPrimalityCheck { +public final class MillerRabinPrimalityCheck { + private MillerRabinPrimalityCheck() { + } /** * Check whether the given number is prime or not diff --git a/src/main/java/com/thealgorithms/maths/MobiusFunction.java b/src/main/java/com/thealgorithms/maths/MobiusFunction.java index e9ead992d7a7..915d0d9a6dae 100644 --- a/src/main/java/com/thealgorithms/maths/MobiusFunction.java +++ b/src/main/java/com/thealgorithms/maths/MobiusFunction.java @@ -12,7 +12,9 @@ * Author: Akshay Dubey (https://github.com/itsAkshayDubey) * * */ -public class MobiusFunction { +public final class MobiusFunction { + private MobiusFunction() { + } /** * This method returns μ(n) of given number n diff --git a/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java b/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java index 01fdd5a6a5a5..ee92470ca35f 100644 --- a/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java +++ b/src/main/java/com/thealgorithms/maths/NonRepeatingElement.java @@ -7,7 +7,9 @@ * Reason to use bitwise operator: It makes our program faster as we are operating on bits and not * on actual numbers. */ -public class NonRepeatingElement { +public final class NonRepeatingElement { + private NonRepeatingElement() { + } public static void main(String[] args) { try (Scanner sc = new Scanner(System.in)) { diff --git a/src/main/java/com/thealgorithms/maths/PalindromeNumber.java b/src/main/java/com/thealgorithms/maths/PalindromeNumber.java index 5dad99ef30e0..a22d63897b37 100644 --- a/src/main/java/com/thealgorithms/maths/PalindromeNumber.java +++ b/src/main/java/com/thealgorithms/maths/PalindromeNumber.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class PalindromeNumber { +public final class PalindromeNumber { + private PalindromeNumber() { + } /** * Check if {@code n} is palindrome number or not * diff --git a/src/main/java/com/thealgorithms/maths/PascalTriangle.java b/src/main/java/com/thealgorithms/maths/PascalTriangle.java index beb9a1e4937e..ef6aa41d6e53 100644 --- a/src/main/java/com/thealgorithms/maths/PascalTriangle.java +++ b/src/main/java/com/thealgorithms/maths/PascalTriangle.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class PascalTriangle { +public final class PascalTriangle { + private PascalTriangle() { + } /** *In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that diff --git a/src/main/java/com/thealgorithms/maths/PerfectCube.java b/src/main/java/com/thealgorithms/maths/PerfectCube.java index f9ed0558b8d5..4104c6238580 100644 --- a/src/main/java/com/thealgorithms/maths/PerfectCube.java +++ b/src/main/java/com/thealgorithms/maths/PerfectCube.java @@ -3,7 +3,9 @@ /** * https://en.wikipedia.org/wiki/Cube_(algebra) */ -public class PerfectCube { +public final class PerfectCube { + private PerfectCube() { + } /** * Check if a number is perfect cube or not diff --git a/src/main/java/com/thealgorithms/maths/PerfectNumber.java b/src/main/java/com/thealgorithms/maths/PerfectNumber.java index 7d6a045166e5..49afd23f91bf 100644 --- a/src/main/java/com/thealgorithms/maths/PerfectNumber.java +++ b/src/main/java/com/thealgorithms/maths/PerfectNumber.java @@ -8,7 +8,9 @@ * * link:https://en.wikipedia.org/wiki/Perfect_number */ -public class PerfectNumber { +public final class PerfectNumber { + private PerfectNumber() { + } /** * Check if {@code number} is perfect number or not diff --git a/src/main/java/com/thealgorithms/maths/Perimeter.java b/src/main/java/com/thealgorithms/maths/Perimeter.java index e3476afaf0b3..f8aa1876d388 100644 --- a/src/main/java/com/thealgorithms/maths/Perimeter.java +++ b/src/main/java/com/thealgorithms/maths/Perimeter.java @@ -1,7 +1,9 @@ package com.thealgorithms.maths; // Perimeter of different 2D geometrical shapes -public class Perimeter { +public final class Perimeter { + private Perimeter() { + } /** * Calculate the Perimeter of regular polygon (equals sides) diff --git a/src/main/java/com/thealgorithms/maths/PiNilakantha.java b/src/main/java/com/thealgorithms/maths/PiNilakantha.java index d00240317997..6d43f134c94c 100644 --- a/src/main/java/com/thealgorithms/maths/PiNilakantha.java +++ b/src/main/java/com/thealgorithms/maths/PiNilakantha.java @@ -1,6 +1,8 @@ package com.thealgorithms.maths; -public class PiNilakantha { +public final class PiNilakantha { + private PiNilakantha() { + } // Calculates Pi using Nilakantha's infinite series // Method 2 in the following link explains the algorithm diff --git a/src/main/java/com/thealgorithms/maths/PollardRho.java b/src/main/java/com/thealgorithms/maths/PollardRho.java index 8ce62336061e..8855a463e81c 100644 --- a/src/main/java/com/thealgorithms/maths/PollardRho.java +++ b/src/main/java/com/thealgorithms/maths/PollardRho.java @@ -35,7 +35,9 @@ * Author: Akshay Dubey (https://github.com/itsAkshayDubey) * * */ -public class PollardRho { +public final class PollardRho { + private PollardRho() { + } /** * This method returns a polynomial in x computed modulo n diff --git a/src/main/java/com/thealgorithms/maths/Pow.java b/src/main/java/com/thealgorithms/maths/Pow.java index 1d8ff2931ee0..3f362fe88d30 100644 --- a/src/main/java/com/thealgorithms/maths/Pow.java +++ b/src/main/java/com/thealgorithms/maths/Pow.java @@ -1,7 +1,9 @@ package com.thealgorithms.maths; // POWER (exponentials) Examples (a^b) -public class Pow { +public final class Pow { + private Pow() { + } public static void main(String[] args) { assert pow(2, 0) == Math.pow(2, 0); // == 1 diff --git a/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java b/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java index cbb2d6132366..93c8252ab929 100644 --- a/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java +++ b/src/main/java/com/thealgorithms/maths/PowerUsingRecursion.java @@ -5,7 +5,9 @@ * @author Bama Charan Chhandogi (https://github.com/BamaCharanChhandogi) */ -public class PowerUsingRecursion { +public final class PowerUsingRecursion { + private PowerUsingRecursion() { + } public static double power(double base, int exponent) { // Base case: anything raised to the power of 0 is 1 diff --git a/src/main/java/com/thealgorithms/maths/PrimeCheck.java b/src/main/java/com/thealgorithms/maths/PrimeCheck.java index 2c9714f1335b..4f928bfe451e 100644 --- a/src/main/java/com/thealgorithms/maths/PrimeCheck.java +++ b/src/main/java/com/thealgorithms/maths/PrimeCheck.java @@ -2,7 +2,9 @@ import java.util.Scanner; -public class PrimeCheck { +public final class PrimeCheck { + private PrimeCheck() { + } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); diff --git a/src/main/java/com/thealgorithms/maths/PrimeFactorization.java b/src/main/java/com/thealgorithms/maths/PrimeFactorization.java index 7e13cc673cd4..9ac50fd9043b 100644 --- a/src/main/java/com/thealgorithms/maths/PrimeFactorization.java +++ b/src/main/java/com/thealgorithms/maths/PrimeFactorization.java @@ -9,7 +9,9 @@ import java.util.ArrayList; import java.util.List; -public class PrimeFactorization { +public final class PrimeFactorization { + private PrimeFactorization() { + } public static List pfactors(int n) { List primeFactors = new ArrayList<>(); diff --git a/src/main/java/com/thealgorithms/maths/PronicNumber.java b/src/main/java/com/thealgorithms/maths/PronicNumber.java index 312af21ea2ba..1ae53c4c4429 100644 --- a/src/main/java/com/thealgorithms/maths/PronicNumber.java +++ b/src/main/java/com/thealgorithms/maths/PronicNumber.java @@ -10,7 +10,9 @@ * * */ -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 68932c0b76bd..f535e9e6929b 100644 --- a/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java +++ b/src/main/java/com/thealgorithms/maths/PythagoreanTriple.java @@ -3,7 +3,9 @@ /** * 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 0caa286231b6..8f5d44dbe146 100644 --- a/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java +++ b/src/main/java/com/thealgorithms/maths/RomanNumeralUtil.java @@ -8,7 +8,9 @@ * @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 c988bb70808c..22e9fee00605 100644 --- a/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java +++ b/src/main/java/com/thealgorithms/maths/SquareFreeInteger.java @@ -14,7 +14,9 @@ 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 2f8fa9a83885..90af556f8e23 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 eb116d21ac36..80d185c93785 100644 --- a/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java +++ b/src/main/java/com/thealgorithms/maths/SquareRootWithNewtonRaphsonMethod.java @@ -14,7 +14,9 @@ * 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 84d21f3082f0..29ff070e9cff 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 dcedf458b09e..22a9f550e114 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 0e2fe9e7a46a..c2a173000a78 100644 --- a/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java +++ b/src/main/java/com/thealgorithms/maths/TrinomialTriangle.java @@ -7,7 +7,9 @@ * * 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 867a1d23f220..81731376b37a 100644 --- a/src/main/java/com/thealgorithms/maths/TwinPrime.java +++ b/src/main/java/com/thealgorithms/maths/TwinPrime.java @@ -9,7 +9,9 @@ * * */ -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 d9aa4f203550..d64c82c6e68e 100644 --- a/src/main/java/com/thealgorithms/maths/VampireNumber.java +++ b/src/main/java/com/thealgorithms/maths/VampireNumber.java @@ -16,7 +16,9 @@ * *

*/ -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 edc3575dfda6..4b73f849bb81 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 b2e4576b6179..afd34933047a 100644 --- a/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java +++ b/src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java @@ -7,7 +7,9 @@ * 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 0fb5b6f17b97..5543463e9749 100644 --- a/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java +++ b/src/main/java/com/thealgorithms/misc/InverseOfMatrix.java @@ -11,7 +11,9 @@ * * 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 baf960f8ecef..c076957344f9 100644 --- a/src/main/java/com/thealgorithms/misc/MapReduce.java +++ b/src/main/java/com/thealgorithms/misc/MapReduce.java @@ -15,7 +15,9 @@ * 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 4d8b980f2409..d4ddffe8ddd7 100644 --- a/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java +++ b/src/main/java/com/thealgorithms/misc/MedianOfMatrix.java @@ -10,6 +10,8 @@ */ 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 58de938394af..6b01cdced23c 100644 --- a/src/main/java/com/thealgorithms/misc/PalindromePrime.java +++ b/src/main/java/com/thealgorithms/misc/PalindromePrime.java @@ -2,7 +2,9 @@ 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 f70a443e96e4..0dfc8ac32a6f 100644 --- a/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java +++ b/src/main/java/com/thealgorithms/misc/RangeInSortedArray.java @@ -2,7 +2,9 @@ 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 a311dac447ed..b51664ce7a5a 100644 --- a/src/main/java/com/thealgorithms/misc/Sort012D.java +++ b/src/main/java/com/thealgorithms/misc/Sort012D.java @@ -11,7 +11,9 @@ * 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 10b6f58096c3..cae2fbdead94 100644 --- a/src/main/java/com/thealgorithms/misc/Sparcity.java +++ b/src/main/java/com/thealgorithms/misc/Sparsity.java @@ -11,15 +11,17 @@ * @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 @@ static double sparcity(double[][] mat) { } } } - // return sparcity + // return sparsity return ((double) zero / (mat.length * mat[1].length)); } @@ -48,7 +50,7 @@ public static void main(String[] args) { 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 b56b907de935..3eb0dc95ffb5 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.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 b5ad02184a00..bf81675af641 100644 --- a/src/main/java/com/thealgorithms/misc/matrixTranspose.java +++ b/src/main/java/com/thealgorithms/misc/matrixTranspose.java @@ -18,7 +18,9 @@ * @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 4ee54bbdacf8..f43841f1f184 100644 --- a/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java +++ b/src/main/java/com/thealgorithms/others/ArrayLeftRotation.java @@ -8,7 +8,9 @@ * @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 29f47cd68ed6..9e6fe6a3fbcc 100644 --- a/src/main/java/com/thealgorithms/others/BFPRT.java +++ b/src/main/java/com/thealgorithms/others/BFPRT.java @@ -5,7 +5,9 @@ /** * 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 3fbb4f9fda68..fb699d89c379 100644 --- a/src/main/java/com/thealgorithms/others/BankersAlgorithm.java +++ b/src/main/java/com/thealgorithms/others/BankersAlgorithm.java @@ -20,7 +20,9 @@ */ 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 a1983feccb2e..b70fffe82c5b 100644 --- a/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java +++ b/src/main/java/com/thealgorithms/others/BrianKernighanAlgorithm.java @@ -20,7 +20,9 @@ *

* 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 c5c3b1f35a7d..85e5cd2c13ae 100644 --- a/src/main/java/com/thealgorithms/others/CRC16.java +++ b/src/main/java/com/thealgorithms/others/CRC16.java @@ -3,7 +3,9 @@ /** * 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 561a33f4dae9..180936ed46c1 100644 --- a/src/main/java/com/thealgorithms/others/CRC32.java +++ b/src/main/java/com/thealgorithms/others/CRC32.java @@ -5,7 +5,9 @@ /** * 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 4ae4d7418fb4..ab39890c9ece 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.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 5a78c0c17412..99441b83993d 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 a32ae246a2ec..55a4c5b81a89 100644 --- a/src/main/java/com/thealgorithms/others/Damm.java +++ b/src/main/java/com/thealgorithms/others/Damm.java @@ -14,7 +14,9 @@ * @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 172e151f79a2..56fc32a96259 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.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 103e943743c7..bb1500e5cdc1 100644 --- a/src/main/java/com/thealgorithms/others/FibbonaciSeries.java +++ b/src/main/java/com/thealgorithms/others/FibbonaciSeries.java @@ -15,7 +15,9 @@ * 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 d25ab303e3ed..9e8879838e38 100644 --- a/src/main/java/com/thealgorithms/others/FloydTriangle.java +++ b/src/main/java/com/thealgorithms/others/FloydTriangle.java @@ -2,7 +2,9 @@ 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 8b15739a6d91..5d2d585d19f5 100644 --- a/src/main/java/com/thealgorithms/others/GuassLegendre.java +++ b/src/main/java/com/thealgorithms/others/GuassLegendre.java @@ -6,7 +6,9 @@ * * @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 57ff204c39b1..0ae1e451bc6a 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.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 cc8c8d09864f..4fdee5d5e70e 100644 --- a/src/main/java/com/thealgorithms/others/Huffman.java +++ b/src/main/java/com/thealgorithms/others/Huffman.java @@ -26,7 +26,9 @@ public int compare(HuffmanNode x, HuffmanNode y) { } } -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 d394ae102130..e4a9cbba45de 100644 --- a/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java +++ b/src/main/java/com/thealgorithms/others/InsertDeleteInArray.java @@ -2,7 +2,9 @@ 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 7fb5645a2726..1caa6b63cddc 100644 --- a/src/main/java/com/thealgorithms/others/KMP.java +++ b/src/main/java/com/thealgorithms/others/KMP.java @@ -4,7 +4,9 @@ * 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 a87eedebee73..1762d6cfac0f 100644 --- a/src/main/java/com/thealgorithms/others/KochSnowflake.java +++ b/src/main/java/com/thealgorithms/others/KochSnowflake.java @@ -24,7 +24,9 @@ * 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 1f7cd121933f..465d7e9c4265 100644 --- a/src/main/java/com/thealgorithms/others/Krishnamurthy.java +++ b/src/main/java/com/thealgorithms/others/Krishnamurthy.java @@ -2,7 +2,9 @@ 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 9aa0f6faa8e6..cb7f5214b0dc 100644 --- a/src/main/java/com/thealgorithms/others/LineSweep.java +++ b/src/main/java/com/thealgorithms/others/LineSweep.java @@ -11,7 +11,9 @@ * 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 fd5433ca7b65..600128a7725b 100644 --- a/src/main/java/com/thealgorithms/others/Luhn.java +++ b/src/main/java/com/thealgorithms/others/Luhn.java @@ -38,7 +38,9 @@ * * @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 15618495646f..6d7588090ba8 100644 --- a/src/main/java/com/thealgorithms/others/Mandelbrot.java +++ b/src/main/java/com/thealgorithms/others/Mandelbrot.java @@ -23,7 +23,9 @@ * 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 3056f14dacfc..0bafc435aa75 100644 --- a/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java +++ b/src/main/java/com/thealgorithms/others/MaximumSumOfDistinctSubarraysWithLengthK.java @@ -8,7 +8,9 @@ * 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 c079d1cbebd2..f982848a5c1a 100644 --- a/src/main/java/com/thealgorithms/others/PasswordGen.java +++ b/src/main/java/com/thealgorithms/others/PasswordGen.java @@ -11,11 +11,8 @@ * @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 2f774e16ba90..e6551ed6b9ee 100644 --- a/src/main/java/com/thealgorithms/others/PerlinNoise.java +++ b/src/main/java/com/thealgorithms/others/PerlinNoise.java @@ -7,7 +7,9 @@ * 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 2499d9373354..259e108a354d 100644 --- a/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java +++ b/src/main/java/com/thealgorithms/others/QueueUsingTwoStacks.java @@ -112,7 +112,9 @@ public boolean isOutStackEmpty() { * * @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 6358ce4aaaba..8188a1a702d0 100644 --- a/src/main/java/com/thealgorithms/others/RabinKarp.java +++ b/src/main/java/com/thealgorithms/others/RabinKarp.java @@ -7,7 +7,9 @@ // 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 5e4662b0b052..695a10648b6c 100644 --- a/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java +++ b/src/main/java/com/thealgorithms/others/RemoveDuplicateFromString.java @@ -6,7 +6,9 @@ /** * @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 0d8cbea0d3b3..cf2f091a102f 100644 --- a/src/main/java/com/thealgorithms/others/ReturnSubsequence.java +++ b/src/main/java/com/thealgorithms/others/ReturnSubsequence.java @@ -2,7 +2,9 @@ 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 7c0fe0b2c6f6..2c26f8eae4dc 100644 --- a/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java +++ b/src/main/java/com/thealgorithms/others/ReverseStackUsingRecursion.java @@ -3,7 +3,9 @@ /* 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 e22db1b99931..a804f8f69db4 100644 --- a/src/main/java/com/thealgorithms/others/RootPrecision.java +++ b/src/main/java/com/thealgorithms/others/RootPrecision.java @@ -2,7 +2,9 @@ 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 c9ebc45483aa..081b0d16dce8 100644 --- a/src/main/java/com/thealgorithms/others/RotateMatriceBy90Degree.java +++ b/src/main/java/com/thealgorithms/others/RotateMatrixBy90Degrees.java @@ -6,7 +6,9 @@ */ 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 @@ static void printMatrix(int[][] arr) { /** * 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 fa3869bc5d2e..15148de176b1 100644 --- a/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java +++ b/src/main/java/com/thealgorithms/others/StringMatchFiniteAutomata.java @@ -6,7 +6,9 @@ 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 d2bc1d5c7add..d27a1648b743 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 bb84d3f767e3..4e30bbb4bdaa 100644 --- a/src/main/java/com/thealgorithms/others/TopKWords.java +++ b/src/main/java/com/thealgorithms/others/TopKWords.java @@ -11,7 +11,9 @@ /* 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 c0fb4d75f84d..8969c002cb22 100644 --- a/src/main/java/com/thealgorithms/others/TowerOfHanoi.java +++ b/src/main/java/com/thealgorithms/others/TowerOfHanoi.java @@ -2,7 +2,9 @@ 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 de44354a6602..01391ec72e78 100644 --- a/src/main/java/com/thealgorithms/others/TwoPointers.java +++ b/src/main/java/com/thealgorithms/others/TwoPointers.java @@ -9,7 +9,9 @@ *

* 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 2144f373e2a4..9088612aaa43 100644 --- a/src/main/java/com/thealgorithms/others/Verhoeff.java +++ b/src/main/java/com/thealgorithms/others/Verhoeff.java @@ -23,7 +23,9 @@ * @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 f4ab56636266..9bcd5df81056 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 e4c0cf9d06a2..164f906a38b8 100644 --- a/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java +++ b/src/main/java/com/thealgorithms/searches/BinarySearch2dArray.java @@ -8,7 +8,9 @@ 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 350a3a6fede1..8e601f9873b3 100644 --- a/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java +++ b/src/main/java/com/thealgorithms/searches/HowManyTimesRotated.java @@ -25,7 +25,9 @@ at the rotated array, to identify the minimum element (say a[i]), we observe tha 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 6e9d73af6b1f..d3d04e4f79cc 100644 --- a/src/main/java/com/thealgorithms/searches/LinearSearchThread.java +++ b/src/main/java/com/thealgorithms/searches/LinearSearchThread.java @@ -2,7 +2,9 @@ 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 8ae304f6103f..bb593503ff61 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 f5ed7f71c9ed..97eab4bb4046 100644 --- a/src/main/java/com/thealgorithms/searches/QuickSelect.java +++ b/src/main/java/com/thealgorithms/searches/QuickSelect.java @@ -10,6 +10,8 @@ * 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 4e5939d6b2b8..6ec1aa5ceb5e 100644 --- a/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java +++ b/src/main/java/com/thealgorithms/searches/SaddlebackSearch.java @@ -16,7 +16,9 @@ * * @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 afd5c194f7c4..c00bfc9da6f5 100644 --- a/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java +++ b/src/main/java/com/thealgorithms/searches/SquareRootBinarySearch.java @@ -14,7 +14,9 @@ * * @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 817d9b355450..acb9fb5cb3cd 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 184e36f04db6..2a48cca0f433 100644 --- a/src/main/java/com/thealgorithms/sorts/BucketSort.java +++ b/src/main/java/com/thealgorithms/sorts/BucketSort.java @@ -8,7 +8,9 @@ /** * 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 7f50deca47aa..7074e2cbe63a 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 f235d2105b72..803085f9f582 100644 --- a/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java +++ b/src/main/java/com/thealgorithms/sorts/MergeSortNoExtraSpace.java @@ -6,7 +6,9 @@ /*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 b5213792d12d..fb6e4d2649cb 100644 --- a/src/main/java/com/thealgorithms/sorts/OddEvenSort.java +++ b/src/main/java/com/thealgorithms/sorts/OddEvenSort.java @@ -3,7 +3,9 @@ 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 d2090bf86646..847b94036ca9 100644 --- a/src/main/java/com/thealgorithms/sorts/RadixSort.java +++ b/src/main/java/com/thealgorithms/sorts/RadixSort.java @@ -2,7 +2,9 @@ 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 9e114b2084fc..fda1975189ec 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.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 d39d40e79a7d..b048d0245b64 100644 --- a/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java +++ b/src/main/java/com/thealgorithms/sorts/SortUtilsRandomGenerator.java @@ -2,7 +2,9 @@ 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 2d8411faca4f..7e2251d70640 100644 --- a/src/main/java/com/thealgorithms/sorts/StrandSort.java +++ b/src/main/java/com/thealgorithms/sorts/StrandSort.java @@ -3,7 +3,9 @@ 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 ac375e2a54f0..ce664b0197fc 100644 --- a/src/main/java/com/thealgorithms/sorts/TopologicalSort.java +++ b/src/main/java/com/thealgorithms/sorts/TopologicalSort.java @@ -16,7 +16,9 @@ * @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 a73697a7df21..a8f5254b22c5 100644 --- a/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java +++ b/src/main/java/com/thealgorithms/stacks/BalancedBrackets.java @@ -16,7 +16,9 @@ * @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 0a206a8ba1e9..41d1c6408ee5 100644 --- a/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java +++ b/src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java @@ -2,7 +2,9 @@ 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 f78a24112d43..2fb03de77de5 100644 --- a/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java +++ b/src/main/java/com/thealgorithms/stacks/DuplicateBrackets.java @@ -11,7 +11,9 @@ 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 2cafdc940650..e3519978c6e5 100644 --- a/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java +++ b/src/main/java/com/thealgorithms/stacks/InfixToPostfix.java @@ -2,7 +2,9 @@ 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 63f1d0b4f30d..b3004a284a15 100644 --- a/src/main/java/com/thealgorithms/stacks/LargestRectangle.java +++ b/src/main/java/com/thealgorithms/stacks/LargestRectangle.java @@ -7,7 +7,9 @@ * @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 5eb895d945e5..d76122b16632 100644 --- a/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java +++ b/src/main/java/com/thealgorithms/stacks/MaximumMinimumWindow.java @@ -27,7 +27,9 @@ * * @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 d681e41fbfc3..f7cbea714eb0 100644 --- a/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java +++ b/src/main/java/com/thealgorithms/stacks/NextGreaterElement.java @@ -41,7 +41,9 @@ Next greater element between (6 to n) is -1 -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 84263d986508..4d37da0e7c31 100644 --- a/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java +++ b/src/main/java/com/thealgorithms/stacks/NextSmallerElement.java @@ -37,7 +37,9 @@ Next smaller element between (0 , 5) is 6 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 0c674ec02a1e..6a0453d887c2 100644 --- a/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java +++ b/src/main/java/com/thealgorithms/stacks/PostfixToInfix.java @@ -16,7 +16,9 @@ * */ -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 fde17c883917..de07dde2d510 100644 --- a/src/main/java/com/thealgorithms/strings/Alphabetical.java +++ b/src/main/java/com/thealgorithms/strings/Alphabetical.java @@ -5,7 +5,9 @@ * 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 e0243fa8edef..78ccbbea4898 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 a20e8b4ad418..7bf7cd9a7c66 100644 --- a/src/main/java/com/thealgorithms/strings/CheckAnagrams.java +++ b/src/main/java/com/thealgorithms/strings/CheckAnagrams.java @@ -7,7 +7,9 @@ * 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 7b4fca3d54ce..44965cc9282c 100644 --- a/src/main/java/com/thealgorithms/strings/CheckVowels.java +++ b/src/main/java/com/thealgorithms/strings/CheckVowels.java @@ -9,7 +9,9 @@ * 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 bfa3114b1c03..95c523ccd411 100644 --- a/src/main/java/com/thealgorithms/strings/HammingDistance.java +++ b/src/main/java/com/thealgorithms/strings/HammingDistance.java @@ -4,7 +4,9 @@ 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 99ba2399c42f..d9187cbf66c4 100644 --- a/src/main/java/com/thealgorithms/strings/HorspoolSearch.java +++ b/src/main/java/com/thealgorithms/strings/HorspoolSearch.java @@ -44,7 +44,9 @@ * 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 d7f436b0de75..088addc6ea45 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.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 963684e4aff3..2e3ee25fb6ea 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.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 a74a10aa05c0..fa9171133a15 100644 --- a/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java +++ b/src/main/java/com/thealgorithms/strings/LongestPalindromicSubstring.java @@ -3,7 +3,9 @@ // 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 ef3902b15df3..e20cc5f0f2f7 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 a8669273a3cd..119d75e4d828 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 c0cab91bb7c6..3567a371d70e 100644 --- a/src/main/java/com/thealgorithms/strings/Palindrome.java +++ b/src/main/java/com/thealgorithms/strings/Palindrome.java @@ -3,7 +3,9 @@ /** * 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 d2c9f3e5baa0..e0989ce86715 100644 --- a/src/main/java/com/thealgorithms/strings/Pangram.java +++ b/src/main/java/com/thealgorithms/strings/Pangram.java @@ -5,7 +5,9 @@ /** * 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 d4abb67440b4..f263292eb7bd 100644 --- a/src/main/java/com/thealgorithms/strings/PermuteString.java +++ b/src/main/java/com/thealgorithms/strings/PermuteString.java @@ -11,7 +11,9 @@ 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 c5f54f745470..b47a77e9226c 100644 --- a/src/main/java/com/thealgorithms/strings/ReverseString.java +++ b/src/main/java/com/thealgorithms/strings/ReverseString.java @@ -3,7 +3,9 @@ /** * 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 0cd2a971b225..e180f6c3991b 100644 --- a/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java +++ b/src/main/java/com/thealgorithms/strings/ReverseStringRecursive.java @@ -4,7 +4,9 @@ * 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 c82ae5c32758..e1352f1197b1 100644 --- a/src/main/java/com/thealgorithms/strings/Rotation.java +++ b/src/main/java/com/thealgorithms/strings/Rotation.java @@ -6,7 +6,9 @@ * 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 28a3df743fc6..131bd4165493 100644 --- a/src/main/java/com/thealgorithms/strings/StringCompression.java +++ b/src/main/java/com/thealgorithms/strings/StringCompression.java @@ -4,7 +4,9 @@ * 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 8f306a20e8f0..0fc87a9da318 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 5d3738522d44..b2759e5bcec9 100644 --- a/src/main/java/com/thealgorithms/strings/ValidParentheses.java +++ b/src/main/java/com/thealgorithms/strings/ValidParentheses.java @@ -4,7 +4,9 @@ // 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 e88acbd18586..025c43b15466 100644 --- a/src/main/java/com/thealgorithms/strings/WordLadder.java +++ b/src/main/java/com/thealgorithms/strings/WordLadder.java @@ -38,7 +38,9 @@ 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 252517dc80cc..3619124745b4 100644 --- a/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java +++ b/src/main/java/com/thealgorithms/strings/longestNonRepeativeSubstring.java @@ -2,7 +2,9 @@ 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 75ab883386f5..ea366ad83b3d 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 3bd197bf8bf8..9628e86b9bff 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 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 a78ef81f32a4..11e4f44500b1 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 54e82f69aa88..bf309928bbf4 100644 --- a/src/test/java/com/thealgorithms/others/CRC16Test.java +++ b/src/test/java/com/thealgorithms/others/CRC16Test.java @@ -5,9 +5,6 @@ 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 4601404c7817..0dac47551868 100644 --- a/src/test/java/com/thealgorithms/strings/IsomorphicTest.java +++ b/src/test/java/com/thealgorithms/strings/IsomorphicTest.java @@ -5,7 +5,9 @@ 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 af8d20ab9b7e..b33037f37cfd 100644 --- a/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java +++ b/src/test/java/com/thealgorithms/strings/ReverseStringRecursiveTest.java @@ -5,8 +5,6 @@ import org.junit.jupiter.api.Test; public class ReverseStringRecursiveTest { - ReverseStringRecursive stringRecursive = new ReverseStringRecursive(); - @Test void shouldAcceptWhenEmptyStringIsPassed() { String expected = "";