Update 0003-longest-substring-without-repeating-characters.cpp as in the video

Submission url: https://leetcode.com/problems/longest-substring-without-repeating-characters/submissions/872218190/
Problem: 0003-longest-substring-without-repeating-characters.cpp
Language: C++

Author: caba5

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

@@ -7,7 +7,7 @@
     Time: O(n)
     Space: O(n)
 */
-
+/*
 class Solution {
 public:
     int lengthOfLongestSubstring(string s) {
@@ -32,3 +32,25 @@ class Solution {
         return result;
     }
 };
+*/
+// Same solution as above with the same amount of total iterations.
+// Above solution: no inner loop, but the "j" variable is not increased at each iteration
+// Below: inner loop increasing "i", outer loop increasing "j".
+class Solution {
+public:
+    int lengthOfLongestSubstring(string& s) {
+        unordered_set<char> chars;
+        int maxSize = 0;
+        int i = 0, j = 0;
+        while (j < s.size()){
+            while (chars.find(s[j]) != chars.end()){
+                chars.erase(s[i]);
+                ++i;
+            }
+            maxSize = max(maxSize, j - i + 1);
+            chars.insert(s[j]);
+            ++j;
+        }
+        return maxSize;
+    }
+};