image solution provide || 5++ language||c||java||javascript||c++||array||
Approach\n Describe your approach to solving the problem. \n1. we sort the array then we check nums[0]+nums[1]>nums[2]if this condition is satisfy then we check
# Approach\n<!-- Describe your approach to solving the problem. -->\n1. we sort the array then we check nums[0]+nums[1]>nums[2]if this condition is satisfy then we check which type of triangle is given\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n\n# using java \n# Code\n```\nclass Solution {\n    public String triangleType(int[] nums) {\n        Arrays.sort(nums);\n        if (nums[0]+nums[1]>nums[2]){\n        if (nums[0]==nums[1]&&nums[1]==nums[2]){\n            return "equilateral";\n        } \n        else if (nums[0]==nums[1]||nums[1]==nums[2]||nums[0]==nums[2]){\n            return "isosceles";\n        } \n        else{\n            return "scalene";\n        }\n    } \n        return "none";\n    }\n}\n```\n# using c \n# Code\n```\n    char* triangleType(int* nums, int numsSize) {\n    int compare(const void* a, const void* b) \n    {\n        return (*(int*)a - *(int*)b);\n    }\n    qsort(nums, numsSize, sizeof(int), compare);\n    if (nums[0]+nums[1]>nums[2]){\n        if (nums[0]==nums[1]&&nums[1]==nums[2]){\n            return "equilateral";\n        } \n        else if (nums[0]==nums[1]||nums[1]==nums[2]||nums[0]==nums[2]){\n            return "isosceles";\n        } \n        else{\n            return "scalene";\n        }\n    } \n        return "none";\n}\n```
['Array', 'Math', 'C', 'Python', 'C++', 'Java']