EASIEST || RUNTIME 0 ms || FASTER THAN 100% Submissions || SORTING
\nclass Solution {\n   public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        int n = nums.length;\n        for(int i =n-1; i>=2; i--) {
```\nclass Solution {\n   public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        int n = nums.length;\n        for(int i =n-1; i>=2; i--) {\n            if(nums[i] < nums[i-1] + nums[i-2]) {\n                return nums[i] + nums[i-1] + nums[i-2];\n            }\n        }\n        return 0;\n    }\n}\n```\nDo upvote if its helpful,Thanks.
['Sorting', 'Java']