Python | 90% faster than other... | Greedy Solution very intuitive | Using sorting technique
\nPlease don\'t forget to upvote if found it helpful!!!\n\nclass Solution:\n    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:\n        
![image](https://assets.leetcode.com/users/images/2853d186-23e7-414b-925b-f13588a50a2e_1658509474.4397042.png)\n***Please don\'t forget to upvote if found it helpful!!!***\n```\nclass Solution:\n    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:\n        # ///// TC O(nlogn) //////\n        asteroids.sort()\n        \n        for asteroid in asteroids:\n            if mass >= asteroid:\n                mass += asteroid\n            else:\n                return False\n        return True\n```
['Greedy', 'Sorting', 'Python', 'Python3']