Python 3, 98% better, explained with simple logic
Logic:\n1. Sort the List to get the top 3 lengths\n2. Check if the largest length is less than sum of other two\n\t3. If 2 is false, drop the max length take ne
***Logic:***\n1. Sort the List to get the top 3 lengths\n2. Check if the largest length is less than sum of other two\n\t3. If 2 is false, drop the max length take next 3 largest length and repeat 1-2\n\t4. if 2 is true, return sum of all lengths\n5. if loop ends, and no possible combination found, return 0\n\n```\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n        A.sort(reverse = True)\n        for i in range(3,len(A)+1):\n            if(A[i-3] < A[i-2] + A[i-1]):\n                return sum(A[i-3:i])\n        return 0\n```
['Python', 'Python3']