style: enable HideUtilityClassConstructor in checkstyle

checkstyle.xml

@@ -175,7 +175,7 @@
     <!-- See https://checkstyle.org/checks/design/index.html -->
     <!-- TODO <module name="DesignForExtension"/> -->
     <!-- TODO <module name="FinalClass"/> -->
-    <!-- TODO <module name="HideUtilityClassConstructor"/> -->
+    <module name="HideUtilityClassConstructor"/>
     <module name="InterfaceIsType"/>
     <!-- TODO <module name="VisibilityModifier"/> -->
 

src/main/java/com/thealgorithms/backtracking/ArrayCombination.java

@@ -7,7 +7,9 @@
  * Finds all permutations of 1...n of length k
  * @author TheClerici (<a href="https://github.com/TheClerici">git-TheClerici</a>)
  */
-public class ArrayCombination {
+public final class ArrayCombination {
+    private ArrayCombination() {
+    }
     private static int length;
 
     /**

src/main/java/com/thealgorithms/backtracking/Combination.java

@@ -9,7 +9,9 @@
  * Finds all permutations of given array
  * @author Alan Piao (<a href="https://github.com/cpiao3">git-Alan Piao</a>)
  */
-public class Combination {
+public final class Combination {
+    private Combination() {
+    }
 
     private static int length;
 

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 = {

src/main/java/com/thealgorithms/backtracking/MColoring.java

@@ -14,7 +14,9 @@ class Node {
     Set<Integer> edges = new HashSet<Integer>();
 }
 
-public class MColoring {
+public final class MColoring {
+    private MColoring() {
+    }
     static int possiblePaint(ArrayList<Node> nodes, int n, int m) {
 
         // Create a visited array of n nodes

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

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);

src/main/java/com/thealgorithms/backtracking/Permutation.java

@@ -7,7 +7,9 @@
  * Finds all permutations of given array
  * @author Alan Piao (<a href="https://github.com/cpiao3">Git-Alan Piao</a>)
  */
-public class Permutation {
+public final class Permutation {
+    private Permutation() {
+    }
 
     /**
      * Find all permutations of given array using backtracking

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

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;
     }

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;

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;

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;

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;

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.

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;

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;

src/main/java/com/thealgorithms/ciphers/ColumnarTranspositionCipher.java

@@ -7,7 +7,9 @@
  *
  * @author <a href="https://github.com/freitzzz">freitzzz</a>
  */
-public class ColumnarTranspositionCipher {
+public final class ColumnarTranspositionCipher {
+    private ColumnarTranspositionCipher() {
+    }
 
     private static String keyword;
     private static Object[][] table;

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);
 

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

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)) {

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;

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

src/main/java/com/thealgorithms/conversions/AnyBaseToDecimal.java

@@ -4,7 +4,9 @@
  * @author Varun Upadhyay (<a href="https://github.com/varunu28">...</a>)
  */
 // 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);

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);

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;

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.

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

src/main/java/com/thealgorithms/conversions/DecimalToAnyBase.java

@@ -8,7 +8,9 @@
  * @author Varun Upadhyay (<a href="https://github.com/varunu28">...</a>)
  */
 // 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));

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

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;

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

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

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) {

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,

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;