Merge pull request DaleStudy#2532 from DaleStudy/yihyun-kim1

yihyun-kim1 · web-flow · commit b422044cb7c2 · 2026-04-12T23:27:36.000+09:00
[yihyun-kim1] WEEK 06 Solutions
diff --git a/longest-increasing-subsequence/yihyun-kim1.js b/longest-increasing-subsequence/yihyun-kim1.js
@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const lengthOfLIS = (nums) => {
+  const dp = new Array(nums.length).fill(1);
+
+  for (let i = 1; i < nums.length; i++) {
+    for (let j = 0; j < i; j++) {
+      if (nums[j] < nums[i]) {
+        dp[i] = Math.max(dp[i], dp[j] + 1);
+      }
+    }
+  }
+
+  return Math.max(...dp);
+};
diff --git a/valid-parentheses/yihyun-kim1.js b/valid-parentheses/yihyun-kim1.js
@@ -0,0 +1,18 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+const isValid = (s) => {
+  const stack = [];
+  const map = { ")": "(", "}": "{", "]": "[" };
+
+  for (const char of s) {
+    if (char === "(" || char === "{" || char === "[") {
+      stack.push(char);
+    } else {
+      if (stack.pop() !== map[char]) return false;
+    }
+  }
+
+  return stack.length === 0;
+};
