C++ || Short & Simple Code || ✅⭐⭐
DO UPVOTE IF IT HELPS !!!!!\n\n----------------------------------------------------------------------------\n\nAPPROACH - Sort the array and when a+b>c, return 
***DO UPVOTE IF IT HELPS !!!!!***\n\n----------------------------------------------------------------------------\n\n**APPROACH** - Sort the array and when a+b>c, return the perimeter (a+b+c) \n\n-------------------------------------------------------------------------\n\n\tint largestPerimeter(vector<int>& nums) {\n        \n        sort(nums.begin(), nums.end());                 //sort the array\n        \n        for(int i=nums.size()-3; i>=0; i--){            //traverse from n-3 to 0\n            if(nums[i]+nums[i+1] > nums[i+2]) {         //if at any instant a + b > c, return perimenter (a+b+c)\n                return  nums[i]+nums[i+1]+nums[i+2];    // a=nums[i], b=nums[i+1], c=nums[i+2];\n            }\n        }\n        return 0;                                       //else return 0\n    }
['C', 'Sorting']