BEATS 100% DART solution
Code\n\nclass Solution {\n  int largestPerimeter(List<int> nums) {\n    nums.sort();\n    int i=nums.length-1;\n    while(i>1){\n        if(nums[i]<nums[i-1]+nu
# Code\n```\nclass Solution {\n  int largestPerimeter(List<int> nums) {\n    nums.sort();\n    int i=nums.length-1;\n    while(i>1){\n        if(nums[i]<nums[i-1]+nums[i-2]) return nums[i]+nums[i-1]+nums[i-2];\n        i--;\n    }\n    return 0;\n  }\n}\n```
['Array', 'Math', 'Greedy', 'Sorting', 'Dart']