Longest subarray with sum-k problem solved

deepak.panwar · deepak.panwar · commit 4e5d86640546 · 2026-03-30T23:36:39.000+05:30
diff --git a/src/main/java/array/algo_company/leetcode/LongestSubArrayWithSumK.java b/src/main/java/array/algo_company/leetcode/LongestSubArrayWithSumK.java
@@ -69,7 +69,7 @@ private static int maxLenLongestKSumSubarray(int[] arr, int k) {
             }
             // Case 2: (sum - k) seen before
             if (map.containsKey(sum - k)) {
-                maxLength = Math.max(maxLength, i - -map.get(sum - k));
+                maxLength = Math.max(maxLength, i - map.get(sum - k));
             } else {
                 map.put(sum, i);
             }

Original file line number	Diff line number	Diff line change
`@@ -69,7 +69,7 @@ private static int maxLenLongestKSumSubarray(int[] arr, int k) {`
`69`	`69`	`}`
`70`	`70`	`// Case 2: (sum - k) seen before`
`71`	`71`	`if (map.containsKey(sum - k)) {`
`72`		`- maxLength = Math.max(maxLength, i - -map.get(sum - k));`
	`72`	`+ maxLength = Math.max(maxLength, i - map.get(sum - k));`
`73`	`73`	`} else {`
`74`	`74`	`map.put(sum, i);`
`75`	`75`	`}`