Create 525. Contiguous Array (#430)

Author: Chayandas07

525. Contiguous Array

@@ -0,0 +1,28 @@
+#include <vector>
+#include <unordered_map>
+#include <algorithm>
+
+class Solution {
+public:
+    int findMaxLength(std::vector<int>& nums) {
+        std::unordered_map<int, int> sumMap;
+        int maxLength = 0;
+        int sum = 0;
+        
+        sumMap[0] = -1; // Initialize with 0 sum at index -1
+        
+        for (int i = 0; i < nums.size(); ++i) {
+            // Increment sum for 1, decrement for 0
+            sum += (nums[i] == 1) ? 1 : -1;
+            
+            
+            if (sumMap.find(sum) != sumMap.end()) {
+                maxLength = std::max(maxLength, i - sumMap[sum]);
+            } else {
+                sumMap[sum] = i; // Store the index of first occurrence of sum
+            }
+        }
+        
+        return maxLength;
+    }
+};