diff --git a/checkstyle.xml b/checkstyle.xml
index e4764fb1..d16549b6 100644
--- a/checkstyle.xml
+++ b/checkstyle.xml
@@ -147,7 +147,7 @@
 
     <!-- Modifier Checks                                    -->
     <!-- See https://checkstyle.org/checks/modifier/index.html -->
-    <!-- TODO <module name="ModifierOrder"/> -->
+    <module name="ModifierOrder"/>
     <!-- TODO <module name="RedundantModifier"/> -->
 
     <!-- Checks for blocks. You know, those {}'s         -->
diff --git a/src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java b/src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java
index 398b6bbb..6b53b1aa 100644
--- a/src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java
+++ b/src/main/java/com/thealgorithms/bitmanipulation/HighestSetBit.java
@@ -12,7 +12,7 @@ public final class HighestSetBit {
     private HighestSetBit() {
     }
 
-    public final static Optional<Integer> findHighestSetBit(int num) {
+    public static Optional<Integer> findHighestSetBit(int num) {
         if (num < 0) {
             throw new IllegalArgumentException("Input cannot be negative");
         }
diff --git a/src/main/java/com/thealgorithms/others/CountWords.java b/src/main/java/com/thealgorithms/others/CountWords.java
index 1defde2c..26b9c50d 100644
--- a/src/main/java/com/thealgorithms/others/CountWords.java
+++ b/src/main/java/com/thealgorithms/others/CountWords.java
@@ -3,7 +3,7 @@ package com.thealgorithms.others;
 /**
  * @author Marcus
  */
-final public class CountWords {
+public final class CountWords {
     private CountWords() {
     }
 
diff --git a/src/main/java/com/thealgorithms/others/EulersFunction.java b/src/main/java/com/thealgorithms/others/EulersFunction.java
index 27c9aed8..f08e5e4f 100644
--- a/src/main/java/com/thealgorithms/others/EulersFunction.java
+++ b/src/main/java/com/thealgorithms/others/EulersFunction.java
@@ -3,7 +3,7 @@ package com.thealgorithms.others;
 /**
  * @brief utility class for <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>
  */
-final public class EulersFunction {
+public final class EulersFunction {
     private EulersFunction() {
     }
 
diff --git a/src/main/java/com/thealgorithms/others/LowestBasePalindrome.java b/src/main/java/com/thealgorithms/others/LowestBasePalindrome.java
index 9bc02535..c8328a4e 100644
--- a/src/main/java/com/thealgorithms/others/LowestBasePalindrome.java
+++ b/src/main/java/com/thealgorithms/others/LowestBasePalindrome.java
@@ -6,7 +6,7 @@ import java.util.ArrayList;
  * @brief Class for finding the lowest base in which a given integer is a palindrome.
      cf. https://oeis.org/A016026
  */
-final public class LowestBasePalindrome {
+public final class LowestBasePalindrome {
     private LowestBasePalindrome() {
     }
 
diff --git a/src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java b/src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java
index d7dcdbd1..1fd9ae28 100644
--- a/src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java
+++ b/src/main/java/com/thealgorithms/others/SieveOfEratosthenes.java
@@ -5,7 +5,7 @@ import java.util.Arrays;
 /**
  * @brief utility class implementing <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes">Sieve of Eratosthenes</a>
  */
-final public class SieveOfEratosthenes {
+public final class SieveOfEratosthenes {
     private SieveOfEratosthenes() {
     }
 
diff --git a/src/main/java/com/thealgorithms/others/cn/HammingDistance.java b/src/main/java/com/thealgorithms/others/cn/HammingDistance.java
index 820917a1..c8239d53 100644
--- a/src/main/java/com/thealgorithms/others/cn/HammingDistance.java
+++ b/src/main/java/com/thealgorithms/others/cn/HammingDistance.java
@@ -1,6 +1,6 @@
 package com.thealgorithms.others.cn;
 
-final public class HammingDistance {
+public final class HammingDistance {
     private HammingDistance() {
     }