"Minimum Number of Arrows to Burst Balloons" solution

Author: lancelote

src/minimum_number_of_arrows_to_burst_balloons.py

@@ -0,0 +1,20 @@
+class Solution:
+    def findMinArrowShots(self, points: list[list[int]]) -> int:
+        assert points
+
+        points = sorted(points)
+
+        n = len(points)
+        arrows = 1
+        _, end = points[0]
+
+        for i in range(1, n):
+            next_start, next_end = points[i]
+
+            if next_start > end:
+                arrows += 1
+                end = next_end
+            elif next_end < end:
+                end = next_end
+
+        return arrows

tests/test_minimum_number_of_arrows_to_burst_balloons.py

@@ -0,0 +1,15 @@
+import pytest
+
+from src.minimum_number_of_arrows_to_burst_balloons import Solution
+
+
+@pytest.mark.parametrize(
+    "points,expected",
+    (
+        ([[10, 16], [2, 8], [1, 6], [7, 12]], 2),
+        ([[1, 2], [3, 4], [5, 6], [7, 8]], 4),
+        ([[1, 2], [2, 3], [3, 4], [4, 5]], 2),
+    ),
+)
+def test_solution(points, expected):
+    assert Solution().findMinArrowShots(points) == expected