Easy Solution - no Sorting
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 {\npublic:\n    string triangleType(vector<int>& nums) {\n\n        // To check if the tirangle is valid of not \n        if(nums[0] + nums[1] <= nums[2] || nums[1] + nums[2] <= nums[0] || nums[0] + nums[2] <= nums[1]) return "none" ;\n        \n        // To check if the tirangle is Equilateral or not \n        else if ( nums[0]==nums[1]&& nums[1]==nums[2] ) return "equilateral" ;\n\n        // To check if the triangle is Isosceles or not \n        else if ( nums[0] == nums[1] || nums[1]== nums[2] || nums[0] == nums[2]) return "isosceles" ;\n\n        // If the triangle is neither isosceles nor Equilateral and is a valid triangle then it is Scalene \n        return "scalene";\n    }\n};\n```
['Array', 'Math', 'C++']