JAVA || 72.15% Faster || O(nlogn) || Beginner Friendly || with comments
\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);   \n        int max=0;\n        for(int i=0;i<=nums.length-3;i++){
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);   \n        int max=0;\n        for(int i=0;i<=nums.length-3;i++){\n            int a = nums[i];     \n            int b = nums[i+1];\n            int c = nums[i+2]; \n            if((a+b)>c){        \n                        int temp = a+b+c;\n                        if(max<temp){\n                            max = temp;      \n                }\n            }else{\n             continue;   \n            }\n        }\n        return max;       \n    }\n    }\n```
['Sorting', 'Java']