Simple with java using HashMap(100% Faster Solution).
Intuition\n- When I understand this problem,Then  firstly HashMap Data Structure was come to mind and then I started work with HashMap and I got better result;\
# Intuition\n- When I understand this problem,Then  firstly HashMap Data Structure was come to mind and then I started work with HashMap and I got better result;\n\n# Approach\n- Take a HashMap and put all the possible sum of array with condition(as you are see in code).\n- Then check simply if map size is 1 then simply return "equilateral" else if map size is 2 then return "isosceles" else simply return "scalene";\n\n# Complexity\n- Time complexity:\n  O(1);\n\n- Space complexity:\n- o(3);\n\n# Code\n```\nclass Solution {\n    public String triangleType(int[] nums) {\n        \n            HashMap<Integer,Integer>map=new HashMap<>();\n\n         int x=nums[0]+nums[1];\n         int y=nums[0]+nums[2];\n         int z=nums[1]+nums[2];\n         if(x>nums[2]) \n         map.put(x,1);\n         else\n         return "none";\n         if(y>nums[1])\n         map.put(y,1);\n         else \n         return "none";\n         if(z>nums[0])\n         map.put(z,1);\n         else\n         return "none";\n         if(map.size()==1)\n         return "equilateral";\n         else if(map.size()==2)\n         return "isosceles";\n         return "scalene";\n    }\n}\n```
['Java']