[TypeScript] Sort solution. No If-Then.
Complexity\nBiggest side must be strictly less then sum of two other.\n\n# Code\n\nconst triangleType = (nums: number[]): string => {\n    const triangles = [\'
# Complexity\nBiggest side must be *strictly* less then sum of two other.\n\n# Code\n```\nconst triangleType = (nums: number[]): string => {\n    const triangles = [\'none\', \'equilateral\', \'isosceles\', \'scalene\'];\n    nums.sort((a, b) => b - a);\n    return triangles[nums[0] < nums[1] + nums[2] ? (new Set(nums)).size : 0];\n};\n```
['Math', 'TypeScript']