C++ || CLEAN & EASY || SORTING
\tclass Solution {\n\tpublic:\n\t\tint largestPerimeter(vector& nums) {\n\t\t\tsort(nums.begin(),nums.end());\n\t\t\tfor(int i=nums.size()-3;i>=0;i--){\n\t\t\t\
\tclass Solution {\n\tpublic:\n\t\tint largestPerimeter(vector<int>& nums) {\n\t\t\tsort(nums.begin(),nums.end());\n\t\t\tfor(int i=nums.size()-3;i>=0;i--){\n\t\t\t\tif(nums[i]+nums[i+1]>nums[i+2])\n\t\t\t\t\treturn nums[i]+nums[i+1]+nums[i+2];\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t};\n\n\tfeel free to ask your doubts :)\n\tand pls upvote if it was helpful :)
['C', 'Sorting']