{"id":904,"date":"2025-08-19T12:27:43","date_gmt":"2025-08-19T06:57:43","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=904"},"modified":"2025-08-19T12:27:44","modified_gmt":"2025-08-19T06:57:44","slug":"asteroid-collision","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/asteroid-collision\/","title":{"rendered":"Asteroid Collision | Leetcode 735 | Optimal Stack Solution"},"content":{"rendered":"\n

We are given an array asteroids<\/code> of integers representing asteroids in a row. The indices of the asteriod in the array represent their relative position in space.<\/p>\n\n\n\n

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.<\/p>\n\n\n\n

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.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> asteroids = [5,10,-5]
Output:<\/strong> [5,10]
Explanation:<\/strong> The 10 and -5 collide resulting in 10. The 5 and 10 never collide.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> asteroids = [8,-8]
Output:<\/strong> []
Explanation:<\/strong> The 8 and -8 collide exploding each other.<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> asteroids = [10,2,-5]
Output:<\/strong> [10]
Explanation:<\/strong> The 2 and -5 collide resulting in -5. The 10 and -5 collide resulting in 10.<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n