EASY APPROACH USING JAVA || 8 MS
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```java []\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        for (int i = nums.length - 1; i >= 2; i--) {\n            int a = nums[i - 2];\n            int b = nums[i - 1];\n            int c = nums[i];\n            if (a + b > c) {\n                return a + c + b ;\n            }\n        }\n        return 0;\n    }\n}\n```
['Java']