Merge pull request #2169 from CodingTestStudy2/최원준

[최원준] 2026/10/13

Author: github-actions[bot]

leetcode3/최원준/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
+
+        
+            
+            

…mber of Intersecting Interval Pairs I.py …mber of Intersecting Interval Pairs I.pyleetcode3/4056. Number of Intersecting Interval Pairs I.py renamed to leetcode3/최원준/4056. Number of Intersecting Interval Pairs I.py leetcode3/4056. Number of Intersecting Interval Pairs I.py renamed to leetcode3/최원준/4056. Number of Intersecting Interval Pairs I.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
+        
+