Readable Solution With Explanation
Sort nums to find longest side and return "none" if the values can not make a triangle (sum of smaller sides is <= greater side).
Count equal sides using for l
1. Sort nums to find longest side and return "none" if the values can not make a triangle (sum of smaller sides is <= greater side). 
2. Count equal sides using for loop with modulus to make it circular.
3. Return string based on how many sides are equivalent.  

# Code
```kotlin []
class Solution {
    fun triangleType(nums: IntArray): String {
        nums.sort()
        if (nums[0] + nums[1] <= nums[2]) return "none"

        var count = 0
        
        for (i in 0..2) {
            if (nums[i] == nums[(i + 1) % 3]) count++
        }

        return when {
            count == 0 -> "scalene"
            count == 1 -> "isosceles"
            else -> "equilateral"
        }
    }
}
```
['Array', 'Math', 'Sorting', 'Kotlin']