Very Basic Java Solution
\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n Arrays.sort(nums);\n \n    for(int i=nums.length-1;i>1;i--){\n        int a = nums[i-2];\n  
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n Arrays.sort(nums);\n \n    for(int i=nums.length-1;i>1;i--){\n        int a = nums[i-2];\n        int b = nums[i-1];\n        int c = nums[i];\n\t\t\n\t\t//sum of all the sides\n\t\t\tint s = a + b + c;\n        \n\t\t//condition for triangle\n        if(a+b>c)\n\t\t{\n            return s;\n        }\n    }\n\n    return 0;\n      \n}\n}\n```
['Sorting', 'Java']