From ca8d57ba1dd37619fe3deb32608f434c38980886 Mon Sep 17 00:00:00 2001
From: Jinyoung Jeong <80400463+jyoung2419@users.noreply.github.com>
Date: Thu, 15 Oct 2026 22:39:21 +0900
Subject: [PATCH 1/2] Create 2239. Find Closest Number to Zero

---
 .../2239. Find Closest Number to Zero"        | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 "leetcode3/\354\240\225\354\247\204\354\230\201/2239. Find Closest Number to Zero"

diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/2239. Find Closest Number to Zero" "b/leetcode3/\354\240\225\354\247\204\354\230\201/2239. Find Closest Number to Zero"
new file mode 100644
index 00000000..d34679de
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/2239. Find Closest Number to Zero"	
@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findClosestNumber = function(nums) {
+    let abs = [];
+
+    for (let i = 0; i<nums.length; i++){    // n
+        abs.push(Math.abs(nums[i]));   
+    }
+
+    abs.sort((a,b)=>a-b);   // n log n
+    
+    if (nums.includes(abs[0])){ // n
+        return abs[0];
+    } else {
+        return -abs[0];
+    }
+};

From b9617665660796949c40d4dac77b8a5f82ee712d Mon Sep 17 00:00:00 2001
From: Jinyoung Jeong <80400463+jyoung2419@users.noreply.github.com>
Date: Thu, 15 Oct 2026 22:40:30 +0900
Subject: [PATCH 2/2] Create 1124. Longest Well-Performing Interval

---
 .../1124. Longest Well-Performing Interval"   | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 "leetcode3/\354\240\225\354\247\204\354\230\201/1124. Longest Well-Performing Interval"

diff --git "a/leetcode3/\354\240\225\354\247\204\354\230\201/1124. Longest Well-Performing Interval" "b/leetcode3/\354\240\225\354\247\204\354\230\201/1124. Longest Well-Performing Interval"
new file mode 100644
index 00000000..120c4e9c
--- /dev/null
+++ "b/leetcode3/\354\240\225\354\247\204\354\230\201/1124. Longest Well-Performing Interval"	
@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} hours
+ * @return {number}
+ */
+var longestWPI = function(hours) {
+    let ans = 0;
+
+    for (let i = 0; i < hours.length; i++) {
+        let sum = 0;
+
+        for (let j = i; j < hours.length; j++) {
+            if (hours[j] > 8) {
+                sum += 1;
+            } else {
+                sum -= 1;
+            }
+
+            if (sum > 0) {
+                ans = Math.max(ans, j - i + 1);
+            }
+        }
+    }
+
+    return ans;
+};