Time: 16 ms (75.27%), Space: 8.6 MB (47.52%) - LeetHub

Author: skully-coder

String/0003-longest-substring-without-repeating-characters/0003-longest-substring-without-repeating-characters.cpp

@@ -0,0 +1,20 @@
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        if(s.size()<=1) return s.size();
+        
+        map<char, int> mp;
+        int curr=0, res=0;
+        for(int i=0;i<s.size();i++) {
+            res=max(res, i-curr);
+            if(mp.find(s[i])!=mp.end() && mp[s[i]]>=curr) {
+                curr = mp[s[i]]+1;
+            }
+            mp[s[i]] = i;
+        }
+        if(res<s.size()-curr) return s.size()-curr;
+		
+        return res;
+        
+    }
+};