📌 Python3 simple naive approach
\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n        A.sort(reverse=True)\n        for i in range(len(A) - 2):\n            if A[i] 
```\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n        A.sort(reverse=True)\n        for i in range(len(A) - 2):\n            if A[i] < A[i+1] + A[i+2]:\n                return A[i] + A[i+1] + A[i+2]\n        return 0\n```
['Python3']