Merge pull request #2164 from CodingTestStudy2/최원준

[최원준] 2026/10/12

Author: github-actions[bot]

leetcode3/4056. Number of Intersecting Interval Pairs I.py

@@ -0,0 +1,20 @@
+class Solution:
+    def countIntersectingIntervals(self, intervals: list[list[int]]) -> int:
+        
+        def check_intersect(point1, point2):
+            s1, e1 = point1
+            s2, e2 = point2
+
+            if e1 < s2:
+                return False
+            if e2 < s1:
+                return False
+            return True
+        
+        n = len(intervals)
+        ans = 0
+        for i in range(n):
+            for j in range(i+1, n):
+                if check_intersect(intervals[i], intervals[j]):
+                    ans+=1
+        return ans