Updated day26 solution

Author: avidLearnerInProgress

30-days-of-code-may/25.uncrossedLines.cpp

@@ -0,0 +1,24 @@
+class Solution {
+   public:
+   int maxUncrossedLines(vector<int>& A, vector<int>& B) {
+       int n=A.size();
+        int m=B.size();
+        
+        int dp[n+1][m+1];
+        
+        
+        for(int i=0;i<=n;++i)
+        {
+            for(int j=0;j<=m;++j)
+            {
+                if(i==0 || j==0)
+                    dp[i][j]=0;
+                else if(A[i-1]==B[j-1])
+                    dp[i][j]=dp[i-1][j-1]+1;
+                else
+                    dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
+            }
+        }
+        return dp[n][m];
+    }
+};

30-days-of-code-may/contiguousArray.cpp

@@ -0,0 +1,26 @@
+class Solution {
+public:
+    int findMaxLength(vector<int>& nums) {
+        int sum=0;
+        unordered_map<int,int> m;
+        unsigned int longestContArray = 0;
+
+        for(int i=0;i<nums.size();i++){
+           sum += (nums[i]==1)?1 : -1;
+            
+           auto it = m.find(sum);
+           if(sum == 0){
+              if(longestContArray < i+1)
+               longestContArray = i+1;
+           }
+            
+           else if(it != m.end()){
+              if(longestContArray < i-it->second)
+               longestContArray = i-it->second;
+           }
+           else if(it == m.end())
+               m.insert({sum,i});
+        }
+        return longestContArray;
+    }
+};