added daily challenge

Author: Pasindu-Vishmika

452. Minimum Number of Arrows to Burst Balloons.py

@@ -0,0 +1,13 @@
+class Solution:
+    def findMinArrowShots(self, points: List[List[int]]) -> int:
+        points.sort(key=lambda x: x[1])
+        
+        arrows = 1
+        prevEnd = points[0][1]
+        
+        for i in range(1, len(points)):
+            if points[i][0] > prevEnd:
+                arrows += 1
+                prevEnd = points[i][1]
+        
+        return arrows