From 344d364a66831034f751389b3482a78e8f599f01 Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Tue, 13 Oct 2026 22:17:29 +0900
Subject: [PATCH 1/3] =?UTF-8?q?Rename=20leetcode3/4056.=20Number=20of=20In?=
 =?UTF-8?q?tersecting=20Interval=20Pairs=20I.py=20to=20leetcode3/=EC=B5=9C?=
 =?UTF-8?q?=EC=9B=90=EC=A4=80/4056.=20Number=20of=20Intersecting=20Interva?=
 =?UTF-8?q?l=20Pairs=20I.py?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../4056. Number of Intersecting Interval Pairs I.py"             | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 rename leetcode3/4056. Number of Intersecting Interval Pairs I.py => "leetcode3/\354\265\234\354\233\220\354\244\200/4056. Number of Intersecting Interval Pairs I.py" (100%)

diff --git a/leetcode3/4056. Number of Intersecting Interval Pairs I.py "b/leetcode3/\354\265\234\354\233\220\354\244\200/4056. Number of Intersecting Interval Pairs I.py"
similarity index 100%
rename from leetcode3/4056. Number of Intersecting Interval Pairs I.py
rename to "leetcode3/\354\265\234\354\233\220\354\244\200/4056. Number of Intersecting Interval Pairs I.py"

From 6a635d63e5bd4b1fc824f221f1ac115e1a79395a Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Tue, 13 Oct 2026 22:19:23 +0900
Subject: [PATCH 2/3] Create 1094. Car Pooling.py

---
 .../1094. Car Pooling.py"                     | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/1094. Car Pooling.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1094. Car Pooling.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1094. Car Pooling.py"
new file mode 100644
index 00000000..0016e6f6
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1094. Car Pooling.py"	
@@ -0,0 +1,33 @@
+#
+
+'''
+1. 아이디어 :
+미리 trip마다 탑승, 내리는 인원들을 구합니다.
+
+2. 시간복잡도 :
+    O(n+n)
+
+3. 자료구조/알고리즘 :
+-
+
+'''
+class Solution:
+    def carPooling(self, trips: list[list[int]], capacity: int) -> bool:
+        n = len(trips)
+        boarding = [0] * 1001
+        curr = 0
+        
+        for passengers, start, end in trips:
+            boarding[start] += passengers
+            boarding[end] -= passengers
+        
+        for i in range(1000):
+            curr += boarding[i]
+            if curr > capacity:
+                return False
+
+        return True
+
+        
+            
+            

From a135ead01f0efadcf11626f2e08f7e65c07ebaea Mon Sep 17 00:00:00 2001
From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com>
Date: Tue, 13 Oct 2026 22:19:41 +0900
Subject: [PATCH 3/3] Create 4061. Minimum Queen Moves to Reach Target.py

---
 ...1. Minimum Queen Moves to Reach Target.py" | 28 +++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/4061. Minimum Queen Moves to Reach Target.py"

diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/4061. Minimum Queen Moves to Reach Target.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/4061. Minimum Queen Moves to Reach Target.py"
new file mode 100644
index 00000000..cd0dfade
--- /dev/null
+++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/4061. Minimum Queen Moves to Reach Target.py"	
@@ -0,0 +1,28 @@
+#
+
+'''
+1. 아이디어 :
+최대 2번 움직입니다
+0번: 같은 점
+1번: 같은 가로/세로/대각
+2번: 위 제외 나머지
+
+2. 시간복잡도 :
+    O(1)
+
+3. 자료구조/알고리즘 :
+-
+
+'''
+class Solution:
+    def minQueenMoves(self, source: list[int], target: list[int]) -> int:
+        s1, s2 = source
+        e1, e2 = target
+        
+        if s1 == e1 and s2 ==e2:
+            return 0
+        if s1 == e1 or s2 == e2 or abs(s1-e1) == abs(s2-e2):
+            return 1
+        return 2
+        
+