MinimumSubarrayWithTarget

MinimumSubarrayWithTarget.py

@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int MinimumSubarrayWithTarget(vector<int>vect,int target,int minlen) {
+
+        int windowStart = 0;
+        int windowSum = 0;
+        for(int windowEnd = 0; windowEnd < vect.size(); windowEnd++) {
+            windowSum += vect[windowEnd];
+            while(windowSum>=target){
+                int windowlength= windowStart-windowEnd+1;
+                minlen=min(minlen,windowlength);
+                windowSum -=vect[windowStart];
+                windowStart += 1;
+            }
+        }
+        return minlen;
+    }
+
+    int main() {
+        vector<int>vect={3,4,7,1,9,2,12,1};
+        int n=vect.size();
+        int target=14;
+        int minlen=INT_MAX;
+        int ans = MinimumSubarrayWithTarget(vect,target,minlen);
+        cout<<abs(ans);
+
+    return 0;
+    }

NoRepeatSubstring.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class NoRepeatSubstring {
+public:
+    static int noRepeatSubstring(string s) {
+        int windowStart = 0;
+        int maxLength = INT_MIN;
+        map<char, int> indexMap;
+        if(s.size() == 0) return 0;
+
+        for(int windowEnd = 0; windowEnd < s.size(); windowEnd++) {
+            char currChar = s[windowEnd];
+            if(indexMap.find(currChar) != indexMap.end()) {
+                windowStart = max(windowStart, indexMap[currChar] + 1);
+            }
+            indexMap[currChar] = windowEnd;
+            maxLength = max(maxLength, windowEnd - windowStart + 1);
+        }
+        return maxLength;
+    } 
+};
+
+int main() {
+    string s = "abcabcbb";
+    cout << NoRepeatSubstring::noRepeatSubstring(s) << endl;
+}