Easy python solution | | Beats 99.15%
\n\n# Code\n\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        l=sorted(nums)[::-1]\n        for i in range(0,len(l)-2):\n     
\n\n# Code\n```\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        l=sorted(nums)[::-1]\n        for i in range(0,len(l)-2):\n            if l[i]<l[i+1]+l[i+2]:\n                return l[i]+l[i+1]+l[i+2]\n        return 0\n```
['Python3']