From 7aceaee64db2105707a6dd4b70e3d534901d6546 Mon Sep 17 00:00:00 2001
From: Luv8436 <luvkumar8436@gmail.com>
Date: Mon, 30 Aug 2021 14:17:24 +0530
Subject: [PATCH] fix the issue

---
 .../java/com/fishercoder/solutions/_325.java  | 50 ++++++++++++-------
 1 file changed, 33 insertions(+), 17 deletions(-)

diff --git a/src/main/java/com/fishercoder/solutions/_325.java b/src/main/java/com/fishercoder/solutions/_325.java
index 0f20c8c77e..9d87257601 100644
--- a/src/main/java/com/fishercoder/solutions/_325.java
+++ b/src/main/java/com/fishercoder/solutions/_325.java
@@ -7,22 +7,38 @@ public class _325 {
 
     public static class Solution1 {
         public int maxSubArrayLen(int[] nums, int k) {
-            Map<Integer, Integer> map = new HashMap();
-            int sum = 0;
-            int max = 0;
-            for (int i = 0; i < nums.length; i++) {
-                sum += nums[i];
-                if (sum == k) {
-                    max = i + 1;
-                } else if (map.containsKey(sum - k)) {
-                    max = Math.max(max, i - map.get(sum - k));
-                }
-                if (!map.containsKey(sum)) {
-                    map.put(sum, i);
-                }
-            }
-            return max;
-        }
+            int n = nums.length;
+            // HashMap to store (sum, index) tuples
+             HashMap<Integer, Integer> map = new HashMap<>();
+             int sum = 0, maxLen = 0;
+ 
+             // traverse the given array
+             for (int i = 0; i < n; i++) {
+                 
+                  // accumulate sum
+                  sum += arr[i];
+                 
+                  // when subarray starts from index '0'
+                  if (sum == k)
+                      maxLen = i + 1;
+ 
+                  // make an entry for 'sum' if it is
+                  // not present in 'map'
+                  if (!map.containsKey(sum)) {
+                      map.put(sum, i);
+                  }
+ 
+                  // check if 'sum-k' is present in 'map'
+                  // or not
+                  if (map.containsKey(sum - k)) {
+                       
+                      // update maxLength
+                      if (maxLen < (i - map.get(sum - k)))
+                          maxLen = i - map.get(sum - k);
+                  }
+             }
+              
+             return maxLen; 
     }
 
-}
\ No newline at end of file
+}