Merge pull request DaleStudy#2526 from reeseo3o/main

reeseo3o · web-flow · commit a453874c2c52 · 2026-04-11T19:33:03.000+09:00
[reeseo3o] WEEK 06 Solutions
diff --git a/container-with-most-water/reeseo3o.js b/container-with-most-water/reeseo3o.js
@@ -0,0 +1,36 @@
+// Brute Force
+// Time Complexity: O(n^2)
+// Space Complexity: O(1)
+const maxAreaBrute = (height) => {
+  let maxWater = 0;
+  for (let i = 0; i < height.length; i++) {
+    for (let j = i + 1; j < height.length; j++) {
+      const area = Math.min(height[i], height[j]) * (j - i);
+      maxWater = Math.max(maxWater, area);
+    }
+  }
+  return maxWater;
+};
+
+// Two Pointer
+// Time Complexity: O(n)
+// Space Complexity: O(1)
+const maxArea = (height) => {
+  let left = 0;
+  let right = height.length - 1;
+  let maxWater = 0;
+
+  while (left < right) {
+    const area = Math.min(height[left], height[right]) * (right - left);
+
+    maxWater = Math.max(maxWater, area);
+
+    if (height[left] < height[right]) {
+      left++;
+    } else {
+      right--;
+    }
+  }
+
+  return maxWater;
+};
diff --git a/valid-parentheses/reeseo3o.js b/valid-parentheses/reeseo3o.js
@@ -0,0 +1,20 @@
+const isValid = (s) => {
+    const stack = [];
+    const map = {
+        "(": ")",
+        "[": "]",
+        "{": "}"
+    };
+    
+    for (const char of s) {
+        if (map[char]) {
+            console.log(char);
+            stack.push(char);
+        } else {
+            if (stack.length === 0 || map[stack.pop()] !== char) {
+                return false;
+            }
+        }
+    }
+    return stack.length === 0;
+}
