Two Solutions in Python 3 (beats ~95%)
One For Loop:\n\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n    \tL, _ = len(A), A.sort()\n    \tfor i in range(L-1,1,-1):\n    \t\t
_One For Loop:_\n```\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n    \tL, _ = len(A), A.sort()\n    \tfor i in range(L-1,1,-1):\n    \t\tif A[i] < A[i-1] + A[i-2]: return sum(A[i-2:i+1])\n    \treturn 0\n\t\t\n\t\t\n```\n_Two For Loops:_\n```\nclass Solution:\n    def largestPerimeter(self, A: List[int]) -> int:\n    \tL, _ = len(A), A.sort()\n    \tfor i in range(L-1,1,-1):\n    \t\ta = A[i]\n    \t\tfor j in range(i-1,0,-1):\n    \t\t\tb, m, c = A[j], a - A[j] + 1, A[j-1]\n    \t\t\tif m > b: break\n    \t\t\tif c >= m: return a + b + c\n    \treturn 0\n\t\t\n\t\t\n\n- Junaid Mansuri\n(LeetCode ID)@hotmail.com
['Python', 'Python3']