From 3c696118dffe1f6d730d5a64e27e56abb98ab688 Mon Sep 17 00:00:00 2001
From: mukul <sharmamukul585@gmail.com>
Date: Sat, 3 Jan 2026 18:20:45 +0530
Subject: [PATCH] Done with Hashing-2

---
 Problem1.java | 23 +++++++++++++++++++++++
 Problem2.java | 30 ++++++++++++++++++++++++++++++
 Problem3.java | 27 +++++++++++++++++++++++++++
 3 files changed, 80 insertions(+)
 create mode 100644 Problem1.java
 create mode 100644 Problem2.java
 create mode 100644 Problem3.java

diff --git a/Problem1.java b/Problem1.java
new file mode 100644
index 00000000..cf5fcc74
--- /dev/null
+++ b/Problem1.java
@@ -0,0 +1,23 @@
+import java.util.HashMap;
+
+class Solution {
+    public int subarraySum(int[] nums, int k) {
+        int rsum=0;
+        int n= nums.length;
+        int count = 0;
+        HashMap <Integer,Integer> map=new HashMap<>();
+
+        map.put(0,1);
+
+        for(int i=0; i<n;i++){
+            rsum += nums[i];
+            //if map conatins y (for ex y = x-z) then increase the count as per frequency
+            if(map.containsKey(rsum - k)){
+                count+= map.get(rsum-k);
+            }
+            //put (rsum and frequency of rsum occcureance)
+                map.put(rsum, map.getOrDefault(rsum, 0)+1);
+        }
+        return count;
+    }
+}
\ No newline at end of file
diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 00000000..b4dc957e
--- /dev/null
+++ b/Problem2.java
@@ -0,0 +1,30 @@
+import java.util.HashMap;
+
+class Solution {
+    public int findMaxLength(int[] nums) {
+        if(nums==null  || nums.length==0) return 0;
+        HashMap<Integer, Integer> map=new HashMap<>();
+        int max=0;
+        int rsum=0; //runnung sum
+        map.put(0,-1);
+        for(int i=0;i<nums.length;i++){
+            if(nums[i]==0){
+                //decrease running sum by 1 if 0 is enountered
+                rsum -=1 ;
+            }
+            else{
+                //increase running sum by 1 if 1 is enountered
+                rsum += 1;
+            }
+            if(map.containsKey(rsum)){
+                int curr=i-map.get(rsum);
+                max= Math.max(max,curr);
+            }
+            else{
+                map.put(rsum,i);
+            }
+        }
+    return max;
+        
+    }
+}
\ No newline at end of file
diff --git a/Problem3.java b/Problem3.java
new file mode 100644
index 00000000..0728132b
--- /dev/null
+++ b/Problem3.java
@@ -0,0 +1,27 @@
+import java.util.*;
+
+class Solution {
+    public int longestPalindrome(String s) {
+
+        HashSet<Character> set=new HashSet<>();
+        int count=0;
+        for(int i=0;i<s.length();i++){
+            char ch= s.charAt(i);
+            //if hashset contains the ch already then increase the count variable by 2
+            if(set.contains(ch)){
+                count+=2;
+                //after count going to even number, remove from set
+                set.remove(ch);
+            }
+            //if set does not have that character then add it
+            else{
+                set.add(ch);
+            }
+        //If set is not empty, increase the count variable by 1    
+        }if(!set.isEmpty()){
+            count++;
+        }
+        //at the end return the value of count variable
+        return count;
+    }
+}
\ No newline at end of file