80% beats, JAVA easy solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n    int n = nums.length;\n    Arrays.sort(nums);\n    if(n<3){\n        return 0;\n    }    \n    for(int i=n-1;i>=2;i--){\n        if(nums[i-1]+nums[i-2]>nums[i]){\n            return nums[i]+nums[i-1]+nums[i-2];\n        }\n    }\n    return 0;\n    }\n}\n```
['Java']