#55Medium#17 in JPMorgan Chase's list· asked at 31 companies
Asteroid Collision
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: asteroids = [5,10,-5] Output: [5,10]
10 and -5 collide; 10 survives.
Example 2
Input: asteroids = [8,-8] Output: []
Example 3
Input: asteroids = [10,2,-5] Output: [10]
Constraints
- •
2 <= asteroids.length <= 10^4 - •
-1000 <= asteroids[i] <= 1000 - •
asteroids[i] != 0