addin algo

Author: ivan1016017

src/my_project/interviews/top_150_questions_round_22/ex_49_min_number_arrows_burst_ballons.py

@@ -0,0 +1,22 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def findMinArrowShots(self, points: List[List[int]]) -> int:
+        if not points:
+            return 0
+        
+        # Sort balloons by end coordinate
+        points.sort(key=lambda x: x[1])
+        
+        arrows = 1
+        current_arrow_pos = points[0][1]
+        
+        for i in range(1, len(points)):
+            # If current balloon starts after the last arrow position,
+            # we need a new arrow
+            if points[i][0] > current_arrow_pos:
+                arrows += 1
+                current_arrow_pos = points[i][1]
+        
+        return arrows        

tests/test_150_questions_round_22/test_49_min_number_arrows_burst_ballons_round_22.py

@@ -0,0 +1,23 @@
+import unittest
+from src.my_project.interviews.top_150_questions_round_22\
+.ex_49_min_number_arrows_burst_ballons import Solution
+
+class ArrowsBurstBallonsTestCase(unittest.TestCase):
+
+    def test_first_pattern(self):
+        solution = Solution()
+        output = solution.findMinArrowShots(points = [[10,16],[2,8],[1,6],[7,12]])
+        target = 2
+        self.assertEqual(output, target)
+
+    def test_second_pattern(self):
+        solution = Solution()
+        output = solution.findMinArrowShots(points = [[1,2],[3,4],[5,6],[7,8]])
+        target = 4
+        self.assertEqual(output, target)
+
+    def test_third_pattern(self):
+        solution = Solution()
+        output = solution.findMinArrowShots(points = [[1,2],[2,3],[3,4],[4,5]])
+        target = 2
+        self.assertEqual(output, target)