DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
DevHireLab
TutorialsBootcamp
ProblemsCode SimulatorAI InterviewSoonContact
Back to Arena
medium
Stack

Asteroid Collision

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Asteroid Collision** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Right-moving push; left-moving: pop smaller right movers **Edge Cases to Consider:** - (1) All moving same direction - (2) All destroyed - (3) Equal-size collision (both destroyed)

Examples

Example 1
Input: [5,10,-5]
Output: [5,10]
Explanation: 10 destroys -5
Example 2
Input: [8,-8]
Output: []
Explanation: Equal, both destroyed
Example 3
Input: [10,2,-5]
Output: [10]
Explanation: 10 survives both

Constraints

  • ▪Input arguments are within valid ranges
  • ▪Optimize for execution speed
  • ▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

  • ▪All moving same direction
  • ▪All destroyed
  • ▪Equal-size collision (both destroyed)
Frequently Asked At
AmazonGoogleMicrosoftAdobe