Fix formatting and Checkstyle issues

Author: VeeruYadav45

src/main/java/com/thealgorithms/datastructures/arrays/LeadersInArray.java

@@ -2,46 +2,48 @@
 
 /**
  * A program to find leaders in an array.
- * https://www.geeksforgeeks.org/dsa/find-a-peak-in-a-given-array/
- * 
+ *
+ * <p>
  * A leader is an element that is greater than all the elements to its right.
  * The rightmost element is always a leader.
  *
- * Example:
- * Input: [16, 17, 4, 3, 5, 2]
- * Output: Leaders are 17, 5, 2
- *
  * Time Complexity: O(n)
  * Space Complexity: O(1)
- * 
+ *
  * Author: https://github.com/VeeruYadav45
  */
-public class LeadersInArray {
+public final class LeadersInArray {
+
+    // Prevent instantiation of this utility class
+    private LeadersInArray() {
+    }
 
     /**
      * Prints all leader elements in the array.
      *
      * @param arr the input array
      */
-    public static void findLeaders(int[] arr) {
+    public static void findLeaders(final int[] arr) {
         int n = arr.length;
-
-        // The rightmost element is always a leader
         int maxFromRight = arr[n - 1];
         System.out.print("Leaders: " + maxFromRight + " ");
 
-        // Traverse the array from right to left
         for (int i = n - 2; i >= 0; i--) {
             if (arr[i] > maxFromRight) {
-                maxFromRight = arr[i]; // Update the new leader
+                maxFromRight = arr[i];
                 System.out.print(maxFromRight + " ");
             }
         }
+        System.out.println();
     }
 
-    // Example usage
-    public static void main(String[] args) {
-        int[] arr = { 16, 17, 4, 3, 5, 2 };
+    /**
+     * Example usage.
+     *
+     * @param args command line arguments (not used)
+     */
+    public static void main(final String[] args) {
+        int[] arr = {16, 17, 4, 3, 5, 2};
         findLeaders(arr);
     }
 }

src/main/java/com/thealgorithms/datastructures/arrays/PeakElement.java

@@ -2,58 +2,60 @@
 
 /**
  * A program to find a peak element in an array.
- * https://www.geeksforgeeks.org/dsa/leaders-in-an-array/
  *
  * <p>
  * A peak element is an element that is greater than or equal to its neighbors.
- * For corner elements, we need to consider only one neighbor.
+ * For corner elements, only one neighbor is considered.
  *
- * Example:
- * Input: [1, 3, 20, 4, 1, 0]
- * Output: Peak element is 20
- *
- * Time Complexity: O(log n) using binary search
+ * Time Complexity: O(n)
  * Space Complexity: O(1)
  *
  * Author: https://github.com/VeeruYadav45
  */
-public class PeakElement {
+public final class PeakElement {
+
+    // Prevent instantiation of this utility class
+    private PeakElement() {
+    }
 
     /**
-     * Finds a peak element in the array using binary search.
+     * Finds the index of any peak element in the array.
      *
      * @param arr the input array
-     * @return the index of any one peak element
+     * @return the index of a peak element
      */
-    public static int findPeakElement(int[] arr) {
+    public static int findPeakElement(final int[] arr) {
         int n = arr.length;
-        int low = 0, high = n - 1;
+        int low = 0;
+        int high = n - 1;
 
         while (low <= high) {
             int mid = low + (high - low) / 2;
 
-            // Check if mid is a peak
             boolean leftOk = (mid == 0) || (arr[mid] >= arr[mid - 1]);
             boolean rightOk = (mid == n - 1) || (arr[mid] >= arr[mid + 1]);
 
             if (leftOk && rightOk) {
                 return mid;
             }
 
-            // If left neighbor is greater, move left
             if (mid > 0 && arr[mid - 1] > arr[mid]) {
                 high = mid - 1;
-            } else { // Otherwise move right
+            } else {
                 low = mid + 1;
             }
         }
 
-        return -1; // Should never reach here if input is valid
+        return -1;
     }
 
-    // Example usage
-    public static void main(String[] args) {
-        int[] arr = { 1, 3, 20, 4, 1, 0 };
+    /**
+     * Example usage.
+     *
+     * @param args command line arguments (not used)
+     */
+    public static void main(final String[] args) {
+        int[] arr = {1, 3, 20, 4, 1, 0};
         int peakIndex = findPeakElement(arr);
         System.out.println("Peak element is " + arr[peakIndex]);
     }