Initial commit

Author: phoenixx1

CodeForces/116A-Tram.cpp

@@ -0,0 +1,18 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int n;
+    cin >> n;
+    int x, y, curr = 0, capacity = 0;
+    for(int i=0; i<n; i++){
+        cin >> x >> y;  
+        curr -= x;
+        curr += y;
+        capacity = max(capacity, curr);
+    }
+    cout << capacity;
+    return 0;
+}

LeetCode/30-Day_LeetCoding_Challenge/Week-2/ContiguousArray.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int findMaxLength(vector<int>& nums) {
+        unordered_map<int, int> frstOccur;
+        frstOccur[0] = 0;
+        int ans = 0, pref = 0;
+        for(int i=0; i<nums.size(); ++i){
+            pref += nums[i] == 0 ? -1 : 1;
+            auto it = frstOccur.find(pref);
+            if(it != frstOccur.end()){
+                ans = max(ans, i + 1 - frstOccur[pref]);
+            }else{
+                frstOccur[pref] = i + 1;
+            }
+        }
+        return ans;
+    }
+};

LeetCode/525-ContiguousArray.cpp

@@ -0,0 +1,18 @@
+class Solution {
+public:
+    int findMaxLength(vector<int>& nums) {
+        unordered_map<int, int> frstOccur;
+        frstOccur[0] = 0;
+        int ans = 0, pref = 0;
+        for(int i=0; i<nums.size(); ++i){
+            pref += nums[i] == 0 ? -1 : 1;
+            auto it = frstOccur.find(pref);
+            if(it != frstOccur.end()){
+                ans = max(ans, i + 1 - frstOccur[pref]);
+            }else{
+                frstOccur[pref] = i + 1;
+            }
+        }
+        return ans;
+    }
+};