diff --git a/LeetCode/0452_Minimum_Number_of_Arrows_to_Burst_Balloons.py b/LeetCode/0452_Minimum_Number_of_Arrows_to_Burst_Balloons.py
new file mode 100644
index 0000000..bd55865
--- /dev/null
+++ b/LeetCode/0452_Minimum_Number_of_Arrows_to_Burst_Balloons.py
@@ -0,0 +1,18 @@
+class Solution:
+    def findMinArrowShots(self, points: List[List[int]]) -> int:
+        if points == []:
+            return 0
+        points.sort(key = lambda x: x[0])
+        start = points[0][0]
+        end = points[0][1]
+        ans = len(points)
+        for i in range(1, len(points)):
+            if start <= points[i][0] <= end:
+                ans -= 1
+                if points[i][1] < end:
+                    end = points[i][1]
+            else:
+                start = points[i][0]
+                end = points[i][1]
+                
+        return ans