Python | O(nlog(n))
\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort()\n        for i in range(len(nums)-1, 1, -1):\n            a, b, 
```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort()\n        for i in range(len(nums)-1, 1, -1):\n            a, b, c = nums[i-2], nums[i-1], nums[i]\n            if (c < a + b):\n                return a + b + c\n        return 0\n```
['Python']