Java Solution ==>> 6 ms, faster than 99.40% of Java online submissions
\nclass Solution {\n    public int largestPerimeter(int[] a) {\n        Arrays.sort(a);\n        for(int i=a.length - 1; i>1; i--){\n             if(a[i] < (a[i
```\nclass Solution {\n    public int largestPerimeter(int[] a) {\n        Arrays.sort(a);\n        for(int i=a.length - 1; i>1; i--){\n             if(a[i] < (a[i-1] + a[i- 2])){\n                  return (a[i]+a[i - 1]+ a[i - 2]);\n             }\n        }\n        return 0;\n    }\n}\n```
['Java']