Python || 5-Liner || 91.8% Solution || sort
python\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort(reverse=True)\n        for i in range(len(nums)-2):\n       
```python\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort(reverse=True)\n        for i in range(len(nums)-2):\n            if sum(nums[i:i+3])>2*nums[i]:\n                return sum(nums[i:i+3])\n        return 0\n```
['Sorting', 'Python']