Super Average Solution with fastest run time [JAVA]✅✅
\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        for(int i=0,n=nums.length;i<n-2;i++)\n            if(nums
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        for(int i=0,n=nums.length;i<n-2;i++)\n            if(nums[n-i-1]<nums[n-i-2]+nums[n-i-3])\n                return nums[n-i-1]+nums[n-i-2]+nums[n-i-3];\n        return 0;\n    }\n}\n```
['Sorting', 'Java']