From 81755abd90ab33e857c5d6e94038c224bedd1d5c Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Thu, 15 Oct 2026 22:39:48 +0900
Subject: [PATCH 1/2] Create 2239. Find Closest Number to Zero.py

---
 .../2239. Find Closest Number to Zero.py"            | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/2239. Find Closest Number to Zero.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/2239. Find Closest Number to Zero.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/2239. Find Closest Number to Zero.py"
new file mode 100644
index 00000000..3a0d011f
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/2239. Find Closest Number to Zero.py"	
@@ -0,0 +1,12 @@
+class Solution:
+    def findClosestNumber(self, nums: list[int]) -> int:
+        ans = -float('inf')
+        diff = float('inf')
+        for num in nums:
+            if abs(num) == diff:
+                ans = max(ans, num)
+            elif abs(num) < diff:
+                diff = abs(num)
+                ans = num
+
+        return ans

From 719833be392cbf22168170b8c3e1cc1abd1aa8e2 Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Thu, 15 Oct 2026 22:40:09 +0900
Subject: [PATCH 2/2] Create 1124. Longest Well-Performing Interval.py

---
 ...1124. Longest Well-Performing Interval.py" | 29 +++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/1124. Longest Well-Performing Interval.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1124. Longest Well-Performing Interval.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1124. Longest Well-Performing Interval.py"
new file mode 100644
index 00000000..8160af0a
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1124. Longest Well-Performing Interval.py"	
@@ -0,0 +1,29 @@
+TLE
+
+class Solution:
+    def longestWPI(self, hours: list[int]) -> int:
+        n = len(hours)
+
+        for i, hour in enumerate(hours):
+            hours[i] = 1 if hour>=9 else -1
+        
+        prefix_sum = [0] * (n+1)
+        
+        for i in range(n):
+            prefix_sum[i+1] = prefix_sum[i] + hours[i]
+            
+        print(prefix_sum[1:])
+        ans = 0
+
+        map = {}
+
+        # for start in range(n):
+        #     for end in range(start + 1, n+1):
+        #         if prefix_sum[end] - prefix_sum[start] > 0:
+        #             ans = max(ans, end - start)
+
+        # for i, prefix in enumerate(prefix_sum):
+
+
+        return ans
+