93.3 % in runtime and 91.6 in space for begginers
\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        #sort the array iin decreasing order\n        #TRIANGLE RULE\n        #sum o
```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        #sort the array iin decreasing order\n        #TRIANGLE RULE\n        #sum of two arre greater than third side\n        nums.sort(reverse=True)\n        for i in range(3,len(nums)+1):\n            if nums[i-3]<nums[i-2]+nums[i-1]:\n                return sum(nums[i-3:i])\n        return 0\n```
['Greedy', 'Sorting', 'Python', 'Python3']