Asteroid Collision | Stack Simulation | JavaScript | LeetCode 735

📝 Description: 🔥 Day 94 of my LeetCode Daily Challenge! In this problem, I solve LeetCode 735 - Asteroid Collision using a Stack-based simulation in JavaScript. This is a classic problem where we simulate collisions between asteroids moving in a straight line. Each asteroid has a direction: Positive → moving right ➡️ Negative → moving left ⬅️ When two asteroids meet, they collide based on their sizes. 🧠 Key Idea: We use a stack to keep track of asteroids that are still alive. When the current asteroid is moving left (less than 0) And the top of the stack is moving right (greater than 0) 👉 A collision happens ⚡ Collision Logic: Let’s compare: top of stack vs current asteroid Cases: If one is bigger → smaller one gets destroyed If both are equal → both get destroyed If current survives → keep checking with previous stack elements 🚀 Approach: Iterate through all asteroids Use a stack to simulate collisions Resolve collisions using a while loop Push asteroid only if it survives Return the final stack ✅ Complexity: Time Complexity: O(n) Space Complexity: O(n) 📚 In this video, you will learn: How to simulate collisions using a stack How to handle multiple collisions in a loop Why stack is the right data structure here How to manage direction-based conditions A common pattern in simulation problems 🔗 Problem Link: https://leetcode.com/problems/asteroid-collision/ If you found this helpful, don’t forget to like, comment, and subscribe for more daily LeetCode solutions, JavaScript DSA problems, and coding interview prep 🚀 #leetcode #javascript #dsa #day94 #asteroidcollision #LeetCode735 #stack #simulation #arrays #codinginterview #algorithms #datastructures #problemsolving #leetcodejavascript #100daysofcode