D. J.:

- Added the leetcode problem and solution for 452 Minimum Number of Arrows to Burst Balloons

Author: nobodyPerfecZ

README.md

@@ -48,6 +48,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 - [290 Word Pattern](https://leetcode.com/problems/word-pattern/description/)
 - [383 Ransom Note](https://leetcode.com/problems/ransom-note/description/)
 - [392 Is Subsequence](https://leetcode.com/problems/is-subsequence/description/)
+- [452 Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/)
 
 ## Development 🔧
 

awesome_python_leetcode/_452_minimum_number_of_arrows_to_burst_balloons.py

@@ -0,0 +1,31 @@
+from typing import List
+
+
+class Solution:
+    def findMinArrowShots(self, points: List[List[int]]) -> int:
+        """
+        There are some spherical balloons taped onto a flat wall that represents the XY-plane.
+        The balloons are represented as a 2D integer array points where points[i] = [xstart, xend]
+        denotes a balloon whose horizontal diameter stretches between xstart and xend.
+        You do not know the exact y-coordinates of the balloons.
+
+        Arrows can be shot up directly vertically (in the positive y-direction) from different
+        points along the x-axis. A balloon with xstart and xend is burst by an arrow shot at
+        x if xstart <= x <= xend. There is no limit to the number of arrows that can be shot.
+        A shot arrow keeps traveling up infinitely, bursting any balloons in its path.
+
+        Given the array points, return the minimum number of arrows that must be shot to burst all balloons.
+        """
+        points = sorted(points, key=lambda p: p[0])
+        l, r = points[0][0], points[0][1]
+        i, output = 1, 1
+        while i < len(points):
+            c_l, c_r = points[i][0], points[i][1]
+            new_l, new_r = max(l, c_l), min(r, c_r)
+            if new_l <= new_r:
+                l, r = new_l, new_r
+            else:
+                l, r = c_l, c_r
+                output += 1
+            i += 1
+        return output

tests/test_452_minimum_number_of_arrows_to_burst_balloons.py

@@ -0,0 +1,20 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._452_minimum_number_of_arrows_to_burst_balloons import (
+    Solution,
+)
+
+
+@pytest.mark.parametrize(
+    argnames=["points", "expected"],
+    argvalues=[
+        ([[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_func(points: List[List[int]], expected: int):
+    min_arrow_shots = Solution().findMinArrowShots(points)
+    assert min_arrow_shots == expected