From a321d57816ab0125c25f5e35559a5c05d987a6b1 Mon Sep 17 00:00:00 2001 From: Ishu vishwakarma Date: Tue, 17 Mar 2026 15:37:18 +0530 Subject: [PATCH] Fix sum calculation by checking even numbers Added modulo operation to check if the number is even before updating the sum. --- Leetcode Challenge/February/java/Subarray Sum Equals K.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Leetcode Challenge/February/java/Subarray Sum Equals K.java b/Leetcode Challenge/February/java/Subarray Sum Equals K.java index 6274eaa..4b64e07 100644 --- a/Leetcode Challenge/February/java/Subarray Sum Equals K.java +++ b/Leetcode Challenge/February/java/Subarray Sum Equals K.java @@ -5,7 +5,7 @@ public int subarraySum(int[] nums, int k) { for (int i = 0; i < nums.length; i++) { - sum += nums[i]; + sum += nums[i]%2; //missing %2 to check even or not if(sum == k) count++; if (map.containsKey(sum - k)) count += map.get(sum - k);