codeboy202410
diff --git a/‎src/main/java/com/thealgorithms/maths/DudeneyNumber.java‎
Lines changed: 1 addition & 5 deletions b/‎src/main/java/com/thealgorithms/maths/DudeneyNumber.java‎
Lines changed: 1 addition & 5 deletions
diff --git a/‎src/main/java/com/thealgorithms/sorts/LinkListSort.java‎
Lines changed: 3 additions & 15 deletions b/‎src/main/java/com/thealgorithms/sorts/LinkListSort.java‎
Lines changed: 3 additions & 15 deletions
diff --git a/‎src/main/java/com/thealgorithms/strings/Anagrams.java‎
Lines changed: 2 additions & 5 deletions b/‎src/main/java/com/thealgorithms/strings/Anagrams.java‎
Lines changed: 2 additions & 5 deletions
@@ -33,10 +33,6 @@ public static boolean isDudeney(int n) {
         }
 
         //If the cube root of the number is not equal to the sum of its digits we return false.
-        if (cube_root != sum_of_digits) {
-            return false;
-        }
-
-        return true;
+        return cube_root == sum_of_digits;
     }
 }
@@ -44,11 +44,7 @@ public static boolean isSorted(int p[], int option) {
                 Arrays.sort(b);
                 // array b is sorted and it will return true when checked with sorted list
                 LinkListSort uu = new LinkListSort();
-                if (uu.compare(a, b)) {
-                    return true;
-                } else {
-                    return false;
-                }
+                return uu.compare(a, b);
                 // The given array and the expected array is checked if both are same then true
                 // is displayed else false is displayed
             case 2:
@@ -73,11 +69,7 @@ public static boolean isSorted(int p[], int option) {
                 }
                 LinkListSort uu1 = new LinkListSort();
                 // array b is not sorted and it will return false when checked with sorted list
-                if (uu1.compare(a, b)) {
-                    return true;
-                } else {
-                    return false;
-                }
+                return uu1.compare(a, b);
                 // The given array and the expected array is checked if both are same then true
                 // is displayed else false is displayed
             case 3:
@@ -103,11 +95,7 @@ public static boolean isSorted(int p[], int option) {
                 Arrays.sort(b);
                 // array b is sorted and it will return true when checked with sorted list
                 LinkListSort uu2 = new LinkListSort();
-                if (uu2.compare(a, b)) {
-                    return true;
-                } else {
-                    return false;
-                }
+                return uu2.compare(a, b);
                 // The given array and the expected array is checked if both are same then true
                 // is displayed else false is displayed
             default:
 
@@ -56,11 +56,8 @@ boolean approach1(String s, String t) {
             Arrays.sort(
                 d
             );/* In this approach the strings are stored in the character arrays and both the arrays are sorted. After that both the arrays are compared for checking anangram */
-            if (Arrays.equals(c, d)) {
-                return true;
-            } else {
-                return false;
-            }
+
+            return Arrays.equals(c, d);
         }
     }
Original file line number	Diff line number	Diff line change
`@@ -33,10 +33,6 @@ public static boolean isDudeney(int n) {`
`33`	`33`	`}`
`34`	`34`
`35`	`35`	`//If the cube root of the number is not equal to the sum of its digits we return false.`
`36`		`- if (cube_root != sum_of_digits) {`
`37`		`- return false;`
`38`		`- }`
`39`		`-`
`40`		`- return true;`
	`36`	`+ return cube_root == sum_of_digits;`
`41`	`37`	`}`
`42`	`38`	`}`
Original file line number	Diff line number	Diff line change
`@@ -56,11 +56,8 @@ boolean approach1(String s, String t) {`
`56`	`56`	`Arrays.sort(`
`57`	`57`	`d`
`58`	`58`	`);/* In this approach the strings are stored in the character arrays and both the arrays are sorted. After that both the arrays are compared for checking anangram */`
`59`		`- if (Arrays.equals(c, d)) {`
`60`		`- return true;`
`61`		`- } else {`
`62`		`- return false;`
`63`		`- }`
	`59`	`+`
	`60`	`+ return Arrays.equals(c, d);`
`64`	`61`	`}`
`65`	`62`	`}`
`66`	`63`