D. J.:

- Added the leetcode problem and solution for 735

Author: nobodyPerfecZ

README.md

@@ -244,6 +244,7 @@
 - [712 Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/description/)
 - [714 Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/)
 - [724 Find Pivot Index](https://leetcode.com/problems/find-pivot-index/description/)
+- [735 Asteroid Collision](https://leetcode.com/problems/asteroid-collision/description/)
 - [740 Delete and Earn](https://leetcode.com/problems/delete-and-earn/description/)
 - [746 Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/description/)
 - [790 Domino and Tromino Tiling](https://leetcode.com/problems/domino-and-tromino-tiling/description/)

awesome_python_leetcode/_735_asteroid_collision.py

@@ -0,0 +1,42 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def asteroidCollision(self, asteroids: List[int]) -> List[int]:
+        """
+        We are given an array asteroids of integers representing asteroids in a row.
+        The indices of the asteriod in the array represent their relative position in
+        space.
+
+        For each asteroid, the absolute value represents its size, and the sign
+        represents its direction (positive meaning right, negative meaning left).
+        Each asteroid moves at the same speed.
+
+        Find out the state of the asteroids after all collisions. If two asteroids meet,
+        the smaller one will explode. If both are the same size, both will explode.
+        Two asteroids moving in the same direction will never meet.
+        """
+        # Time Complexity: O(n)
+        # Space Complexity: O(n)
+        res = []
+        for asteroid in asteroids:
+            while res and asteroid < 0 and res[-1] > 0:
+                diff = asteroid + res[-1]
+                if diff < 0:
+                    # abs(asteroid) > abs(res[-1])
+                    # res destroyed
+                    res.pop()
+                elif diff > 0:
+                    # abs(asteroid) < abs(res[-1])
+                    # asteroid destroyed
+                    asteroid = 0
+                else:
+                    # abs(asteroid) == abs(res[-1])
+                    # both destroyed
+                    asteroid = 0
+                    res.pop()
+            if asteroid:
+                res.append(asteroid)
+        return res

tests/test_735_asteroid_collision.py

@@ -0,0 +1,19 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._735_asteroid_collision import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["asteroids", "expected"],
+    argvalues=[
+        ([5, 10, -5], [5, 10]),
+        ([8, -8], []),
+        ([10, 2, -5], [10]),
+    ],
+)
+def test_func(asteroids: List[int], expected: List[int]):
+    """Tests the solution of a LeetCode problem."""
+    asteroids_left = Solution().asteroidCollision(asteroids)
+    assert asteroids_left == expected