Concise Kotlin solution
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: $$O(1)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    fun triangleType(nums: IntArray): String {\n        nums.sort()\n        \n        if(nums[0] + nums[1] <= nums[2]) {\n            return "none"\n        }\n        \n        val counterMap = nums.toTypedArray().groupingBy { it }.eachCount()\n\n        return when (counterMap.size) {\n            1 -> "equilateral"\n            2 -> "isosceles"\n            else -> "scalene"\n        }\n    }\n}\n```
['Kotlin']