Added Files

Author: HxnDev

Largest Contiguous Subarray Problem/C++/main.cpp

@@ -0,0 +1,26 @@
+ int findMaxLength(int nums[], int n) 
+ {
+  int maxlen = 0;
+  
+  for (int start = 0; start < n; start++) 
+  {
+    int zeroes = 0, ones = 0;
+    
+    for (int end = start; end < n; end++) 
+    {
+      if (nums[end] == 0) 
+      {
+        zeroes++;
+      } 
+      else 
+      {
+        ones++;
+      }
+      if (zeroes == ones) 
+      {
+        maxlen = max(maxlen, end - start + 1);
+      }
+    }
+  }
+  return maxlen;
+}

Largest Contiguous Subarray Problem/Python/main.py

@@ -0,0 +1,17 @@
+class Solution:
+
+    def findMaxLength(nums):
+        maxlen = 0
+        for start in range(0, len(nums)):
+            zeroes = 0
+            ones = 0
+            for end in range(start, len(nums)):
+                if nums[end] == 0:
+                    zeroes += 1
+                else:
+                    ones += 1
+    
+                if zeroes == ones:
+                    maxlen = max(maxlen, end - start + 1)
+    
+        return maxlen