You are given an integer mass, which represents the initial mass of a planet. You are also given an integer array asteroids, where asteroids[i] is the mass of the $i^{ ext{th}}$ asteroid.

You can choose the order in which the planet collides with the asteroids. If the planet’s mass is greater than or equal to the mass of the colliding asteroid, the asteroid is destroyed, and the asteroid’s mass is added to the planet’s total mass. Otherwise, the planet is destroyed.

Return true if all asteroids can be destroyed, or false otherwise.

Constraints:

• $1 \leq$ mass $\leq 10^5$

• $1 \leq$ asteroids.length $\leq 10^5$

• $1 \leq$ asteroids[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.