2126. Destroying Asteroids LeetCode Solution

In this guide, you will get 2126. Destroying Asteroids LeetCode Solution with the best time and space complexity. The solution to Destroying Asteroids problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Destroying Asteroids solution in C++
4. Destroying Asteroids solution in Java
5. Destroying Asteroids solution in Python
6. Additional Resources

Problem Statement of Destroying Asteroids

You are given an integer mass, which represents the original mass of a planet. You are further given an integer array asteroids, where asteroids[i] is the mass of the ith asteroid.
You can arrange for the planet to collide with the asteroids in any arbitrary order. If the mass of the planet is greater than or equal to the mass of the asteroid, the asteroid is destroyed and the planet gains the mass of the asteroid. Otherwise, the planet is destroyed.
Return true if all asteroids can be destroyed. Otherwise, return false.

Example 1:

Input: mass = 10, asteroids = [3,9,19,5,21]
Output: true
Explanation: One way to order the asteroids is [9,19,5,3,21]:
– The planet collides with the asteroid with a mass of 9. New planet mass: 10 + 9 = 19
– The planet collides with the asteroid with a mass of 19. New planet mass: 19 + 19 = 38
– The planet collides with the asteroid with a mass of 5. New planet mass: 38 + 5 = 43
– The planet collides with the asteroid with a mass of 3. New planet mass: 43 + 3 = 46
– The planet collides with the asteroid with a mass of 21. New planet mass: 46 + 21 = 67
All asteroids are destroyed.

Example 2:

Input: mass = 5, asteroids = [4,9,23,4]
Output: false
Explanation:
The planet cannot ever gain enough mass to destroy the asteroid with a mass of 23.
After the planet destroys the other asteroids, it will have a mass of 5 + 4 + 9 + 4 = 22.
This is less than 23, so a collision would not destroy the last asteroid.

Constraints:

1 <= mass <= 105
1 <= asteroids.length <= 105
1 <= asteroids[i] <= 105

Complexity Analysis

• Time Complexity: O(\texttt{sort})
• Space Complexity: O(\texttt{sort})

2126. Destroying Asteroids LeetCode Solution in C++

class Solution {
 public:
  bool asteroidsDestroyed(int mass, vector<int>& asteroids) {
    ranges::sort(asteroids);

    long m = mass;

    for (const int asteroid : asteroids)
      if (m >= asteroid)
        m += asteroid;
      else
        return false;

    return true;
  }
};
/* code provided by PROGIEZ */

2126. Destroying Asteroids LeetCode Solution in Java

class Solution {
  public boolean asteroidsDestroyed(int mass, int[] asteroids) {
    Arrays.sort(asteroids);

    long m = mass;

    for (final int asteroid : asteroids)
      if (m >= asteroid)
        m += asteroid;
      else
        return false;

    return true;
  }
}
// code provided by PROGIEZ

2126. Destroying Asteroids LeetCode Solution in Python

class Solution:
  def asteroidsDestroyed(self, mass: int, asteroids: list[int]) -> bool:
    for asteroid in sorted(asteroids):
      if mass >= asteroid:
        mass += asteroid
      else:
        return False
    return True
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.