[yihyun-kim1] WEEK 05 Solutions

best-time-to-buy-and-sell-stock/yihyun-kim1.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} prices
+ * @return {number}
+ */
+const maxProfit = (prices) => {
+  let minPrice = prices[0];
+  let maxProfit = 0;
+
+  for (let i = 1; i < prices.length; i++) {
+    minPrice = Math.min(minPrice, prices[i]);
+    maxProfit = Math.max(maxProfit, prices[i] - minPrice);
+  }
+
+  return maxProfit;
+};

group-anagrams/yihyun-kim1.js

@@ -0,0 +1,18 @@
+/**
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
+const groupAnagrams = (strs) => {
+  const map = new Map();
+
+  for (const str of strs) {
+    const sorted = str.split("").sort().join("");
+
+    if (!map.has(sorted)) {
+      map.set(sorted, []);
+    }
+    map.get(sorted).push(str);
+  }
+
+  return [...map.values()];
+};

word-break/yihyun-kim1.js

@@ -0,0 +1,20 @@
+/**
+ * @param {string} s
+ * @param {string[]} wordDict
+ * @return {boolean}
+ */
+const wordBreak = (s, wordDict) => {
+  const dp = new Array(s.length + 1).fill(false);
+  dp[0] = true;
+
+  for (let i = 1; i <= s.length; i++) {
+    for (const word of wordDict) {
+      const start = i - word.length;
+      if (start >= 0 && dp[start] && s.slice(start, i) === word) {
+        dp[i] = true;
+      }
+    }
+  }
+
+  return dp[s.length];
+};