Refactor Sliding Window algorithm implementation and tests

Author: Chiefpatwal

src/main/java/com/thealgorithms/slidingwindow/maxSumKSizeSubarray.java renamed to src/main/java/com/thealgorithms/slidingwindow/MaxSumKSizeSubarray.java

@@ -12,7 +12,7 @@
  *
  * @author Your Name (https://github.com/Chiefpatwal)
  */
-class MaxSumKSizeSubarray {
+public class MaxSumKSizeSubarray {
 
     // Prevent instantiation
     private MaxSumKSizeSubarray() {
@@ -22,15 +22,15 @@ private MaxSumKSizeSubarray() {
      * This method finds the maximum sum of a subarray of a given size k.
      *
      * @param arr is the input array where the maximum sum needs to be found
-     * @param k is the size of the subarray
+     * @param k   is the size of the subarray
      * @return the maximum sum of the subarray of size k
      */
-    public static int max_sum_k_size_subarray(int[] arr, int k) {
+    public static int maxSumKSizeSubarray(int[] arr, int k) {
         if (arr.length < k) {
             return -1; // Edge case: not enough elements
         }
 
-        int maxSum = 0;
+        int maxSum ;
         int windowSum = 0;
 
         // Calculate the sum of the first window

src/test/java/com/thealgorithms/slidingwindow/maxSumKSizeSubarrayTest.java renamed to src/test/java/com/thealgorithms/slidingwindow/MaxSumKSizeSubarrayTest.java

@@ -5,11 +5,11 @@
 import org.junit.jupiter.api.Test;
 
 /**
- * Unit tests for the SlidingWindow class.
+ * Unit tests for the MaxSumKSizeSubarray class.
  *
  * @author Your Name (https://github.com/Chiefpatwal)
  */
-class SlidingWindowTest {
+class MaxSumKSizeSubarrayTest {
 
     /**
      * Test for the basic case of finding the maximum sum.
@@ -19,7 +19,7 @@ void testMaxSumKSizeSubarray() {
         int[] arr = {1, 2, 3, 4, 5};
         int k = 2;
         int expectedMaxSum = 9; // 4 + 5
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 
     /**
@@ -30,7 +30,7 @@ void testMaxSumKSizeSubarrayWithDifferentValues() {
         int[] arr = {2, 1, 5, 1, 3, 2};
         int k = 3;
         int expectedMaxSum = 9; // 5 + 1 + 3
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 
     /**
@@ -41,7 +41,7 @@ void testMaxSumKSizeSubarrayWithInsufficientElements() {
         int[] arr = {1, 2};
         int k = 3; // Not enough elements
         int expectedMaxSum = -1; // Edge case
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 
     /**
@@ -52,7 +52,7 @@ void testMaxSumKSizeSubarrayWithLargeArray() {
         int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
         int k = 5;
         int expectedMaxSum = 40; // 6 + 7 + 8 + 9 + 10
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 
     /**
@@ -63,7 +63,7 @@ void testMaxSumKSizeSubarrayWithNegativeNumbers() {
         int[] arr = {-1, -2, -3, -4, -5};
         int k = 2;
         int expectedMaxSum = -3; // -1 + -2
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 
     /**
@@ -74,6 +74,6 @@ void testMaxSumKSizeSubarrayWithKEqualToArrayLength() {
         int[] arr = {1, 2, 3, 4, 5};
         int k = 5;
         int expectedMaxSum = 15; // 1 + 2 + 3 + 4 + 5
-        assertEquals(expectedMaxSum, SlidingWindow.maxSumKSizeSubarray(arr, k));
+        assertEquals(expectedMaxSum, MaxSumKSizeSubarray.maxSumKSizeSubarray(arr, k));
     }
 }