Asteroid Collision

You are given an integer array asteroids representing asteroids in a row. Absolute value is size, and sign is direction: positive moves right and negative moves left. All asteroids move at the same speed.
When two asteroids moving toward each other collide, the smaller one explodes. If their sizes are equal, both explode. Asteroids moving in the same direction never collide.
Return the asteroids remaining after every collision, in original left-to-right order.

Function
asteroidCollision(asteroids: int[]) → int[]

Examples
Example 1
asteroids = [5,10,-5]
return = [5,10]
Asteroid 10 destroys -5; 5 never collides.
Example 2
asteroids = [8,-8]
return = []
The approaching asteroids have equal size, so both explode.
Example 3
asteroids = [10,2,-5]
return = [10]
-5 destroys 2, then 10 destroys -5.

Constraints
1 <= asteroids.length <= 100000
-10^9 <= asteroids[i] <= 10^9
asteroids[i] != 0

Walk the array once and keep a stack of survivors. Push any positive asteroid. When you hit a negative one, it only fights if the stack top is positive. While the top is positive and smaller than the absolute value of the incoming one, pop it. If the top equals it, pop and destroy both. If the top is larger, the incoming one dies. If the stack is empty or the top is negative, push it. The common pitfall is using an if instead of a while, so one negative asteroid fails to chew through several smaller positives. Another is forgetting the equal-size case, or letting a negative collide with a negative below it. This runs in O(n) time because each asteroid is pushed and popped at most once. With 100000 elements, anything quadratic is risky. If you freeze during the live OA, StealthCoder can hand you this loop as a hedge.

If this hits your live OA and you blank, StealthCoder solves it in seconds, invisible to the proctor.