Easy Solution in C .
IntuitionApproachComplexity
Time complexity: O(1) .

Space complexity: O(1) .
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity: O(1) .
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(1) .
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```c []
char* triangleType(int* arr, int arrsize) {
    if ((arr[0] == arr[1]) && (arr[1] == arr[2])) {
        return "equilateral";
    } 
    else if (arr[0] + arr[1] > arr[2] && arr[1] + arr[2] > arr[0] &&
               arr[0] + arr[2] > arr[1]) {
        if (arr[0] == arr[1] || arr[1] == arr[2] || arr[0] == arr[2]) {
            return "isosceles";
        } 
        else if (arr[0] != arr[1] && arr[1] != arr[2] && arr[0] != arr[2]) {
            return "scalene";
        }
    }
    return "none";
}
```
['C']