Minimize PalindromeNumber solution

Author: andrei-punko

src/main/java/by/andd3dfx/common/MaximumGap.java

@@ -29,7 +29,6 @@ public static int determine(int[] nums) {
         }
 
         Arrays.sort(nums);
-
         int result = 0;
         for (int i = 1; i < nums.length; i++) {
             var diff = nums[i] - nums[i - 1];

src/main/java/by/andd3dfx/numeric/PalindromeNumber.java

@@ -15,15 +15,11 @@ public static boolean isPalindrome(int x) {
         }
 
         var chars = String.valueOf(x).toCharArray();
-        var left = 0;
-        var right = chars.length - 1;
-
-        while (left < right) {
-            if (chars[left] != chars[right]) {
+        var n = chars.length;
+        for (int i = 0; i < n / 2; i++) {
+            if (chars[i] != chars[n - i - 1]) {
                 return false;
             }
-            left++;
-            right--;
         }
         return true;
     }