Format LongestSubarrayWithSumLessOrEqualToK algorithm and tests with clang-format

Author: Chiefpatwal

src/main/java/com/thealgorithms/slidingwindow/LongestSubarrayWithSumLessOrEqualToK.java

@@ -10,7 +10,7 @@
  * Average performance O(n)
  * Worst-case space complexity O(1)
  *
- * @author  (https://github.com/Chiefpatwal)
+ * @author (https://github.com/Chiefpatwal)
  */
 public final class LongestSubarrayWithSumLessOrEqualToK {
 
@@ -26,23 +26,23 @@ private LongestSubarrayWithSumLessOrEqualToK() {
      * @return the length of the longest subarray with sum less than or equal to k
      */
     public static int longestSubarrayWithSumLEK(int[] arr, int k) {
-        int maxLength = 0;
-        int currentSum = 0;
-        int left = 0;
+        int maxLength = 0; // To store the maximum length found
+        int currentSum = 0; // To store the current sum of the window
+        int left = 0; // Left index of the sliding window
 
         for (int right = 0; right < arr.length; right++) {
-            currentSum += arr[right];
+            currentSum += arr[right]; // Expand the window to the right
 
             // Shrink the window from the left if the current sum exceeds k
-            while (currentSum > k) {
-                currentSum -= arr[left];
-                left++;
+            while (currentSum > k && left <= right) {
+                currentSum -= arr[left]; // Remove the leftmost element
+                left++; // Move the left index to the right
             }
 
             // Update maxLength if the current window is valid
             maxLength = Math.max(maxLength, right - left + 1);
         }
 
-        return maxLength;
+        return maxLength; // Return the maximum length found
     }
 }

src/test/java/com/thealgorithms/slidingwindow/LongestSubarrayWithSumLessOrEqualToKTest.java

@@ -4,20 +4,12 @@
 
 import org.junit.jupiter.api.Test;
 
-/**
- * Unit tests for the LongestSubarrayWithSumLessOrEqualToK class.
- *
- * @author  (https://github.com/Chiefpatwal)
- */
 public class LongestSubarrayWithSumLessOrEqualToKTest {
-
     @Test
     public void testLongestSubarrayWithSumLEK() {
-        // Test cases for the longestSubarrayWithSumLEK method
-        assertEquals(5, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4, 5}, 11));
-        assertEquals(3, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4, 5}, 7));
-        assertEquals(2, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4, 5}, 3));
-        assertEquals(0, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {}, 0));
-        assertEquals(4, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {2, 1, 5, 2, 3, 2}, 7));
+        assertEquals(3, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 6)); // {1, 2, 3}
+        assertEquals(4, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3, 4}, 10)); // {1, 2, 3, 4}
+        assertEquals(2, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {5, 1, 2, 3}, 5)); // {5}
+        assertEquals(0, LongestSubarrayWithSumLessOrEqualToK.longestSubarrayWithSumLEK(new int[] {1, 2, 3}, 0)); // No valid subarray
     }
 }