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

yihyun-kim1 · web-flow · commit 738de3226461 · 2026-03-22T22:53:21.000+09:00
[yihyun-kim1] WEEK 03 Solutions
diff --git a/maximum-subarray/yihyun-kim1.js b/maximum-subarray/yihyun-kim1.js
@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+const maxSubArray = (nums) => {
+  let currentSum = nums[0];
+  let maxSum = nums[0];
+
+  for (let i = 1; i < nums.length; i++) {
+    currentSum = Math.max(nums[i], currentSum + nums[i]);
+    maxSum = Math.max(maxSum, currentSum);
+  }
+
+  return maxSum;
+};
diff --git a/number-of-1-bits/yihyun-kim1.js b/number-of-1-bits/yihyun-kim1.js
@@ -0,0 +1,8 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+const hammingWeight = (n) => {
+  const binary = n.toString(2);
+  return binary.split("").filter((bit) => bit === "1").length;
+};
diff --git a/valid-palindrome/yihyun-kim1.js b/valid-palindrome/yihyun-kim1.js
@@ -0,0 +1,10 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+const isPalindrome = (s) => {
+  const cleaned = s.toLowerCase().replace(/[^a-z0-9]/g, "");
+  const flipped = cleaned.split("").reverse().join("");
+
+  return cleaned === flipped;
+};
