diff --git a/checkstyle.xml b/checkstyle.xml
index ce584392b089..7a91d52106a9 100644
--- a/checkstyle.xml
+++ b/checkstyle.xml
@@ -109,7 +109,7 @@
     <!-- Checks for Naming Conventions.                  -->
     <!-- See https://checkstyle.org/checks/naming/index.html -->
     <module name="ConstantName"/>
-    <!-- TODO <module name="LocalFinalVariableName"/> -->
+    <module name="LocalFinalVariableName"/>
     <!-- TODO <module name="LocalVariableName"/> -->
     <!-- TODO <module name="MemberName"/> -->
     <!-- TODO <module name="MethodName"/> -->
diff --git a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java
index 88e008cf8a08..acf1e55d49c8 100644
--- a/src/main/java/com/thealgorithms/maths/DudeneyNumber.java
+++ b/src/main/java/com/thealgorithms/maths/DudeneyNumber.java
@@ -16,13 +16,13 @@ public static boolean isDudeney(final int n) {
             throw new IllegalArgumentException("Input must me positive.");
         }
         // Calculating Cube Root
-        final int cube_root = (int) Math.round(Math.pow(n, 1.0 / 3.0));
+        final int cubeRoot = (int) Math.round(Math.pow(n, 1.0 / 3.0));
         // If the number is not a perfect cube the method returns false.
-        if (cube_root * cube_root * cube_root != n) {
+        if (cubeRoot * cubeRoot * cubeRoot != n) {
             return false;
         }
 
         // If the cube root of the number is not equal to the sum of its digits, we return false.
-        return cube_root == SumOfDigits.sumOfDigits(n);
+        return cubeRoot == SumOfDigits.sumOfDigits(n);
     }
 }
diff --git a/src/main/java/com/thealgorithms/sorts/SimpleSort.java b/src/main/java/com/thealgorithms/sorts/SimpleSort.java
index e68b9a87acb2..7aab7c784b92 100644
--- a/src/main/java/com/thealgorithms/sorts/SimpleSort.java
+++ b/src/main/java/com/thealgorithms/sorts/SimpleSort.java
@@ -4,10 +4,10 @@ public class SimpleSort implements SortAlgorithm {
 
     @Override
     public <T extends Comparable<T>> T[] sort(T[] array) {
-        final int LENGTH = array.length;
+        final int length = array.length;
 
-        for (int i = 0; i < LENGTH; i++) {
-            for (int j = i + 1; j < LENGTH; j++) {
+        for (int i = 0; i < length; i++) {
+            for (int j = i + 1; j < length; j++) {
                 if (SortUtils.less(array[j], array[i])) {
                     T element = array[j];
                     array[j] = array[i];