[Leo] 6th Week solutions (partial solutions for the first two Qs)

Author: leokim0922

container-with-most-water/Leo.py

@@ -0,0 +1,19 @@
+class Solution:
+    def maxArea(self, height: List[int]) -> int:
+        left = 0
+        right = len(height) - 1
+
+        maxWater = 0
+
+        while left <= right:
+            hori = right - left
+            vert = min(height[left], height[right])
+            maxWater = max(maxWater, hori * vert)
+
+            if height[left] < height[right]:
+                left += 1
+            else:
+                right -= 1
+
+        return maxWater
+        # TC: O(n) SC: O(1)

longest-substring-without-repeating-characters/Leo.py

@@ -0,0 +1,15 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        left = 0
+        seen = {}
+        res = 0
+
+        for right, curr in enumerate(s):
+            if curr in seen:
+                left = max(left, seen[curr] + 1)
+            res = max(res, right - left + 1)
+            seen[curr] = right
+
+        return res
+
+        ## TC:O(n), SC:O(min(m,n)) where n is len(s) and m is size(seen)