Today’s problem

https://leetcode.com/problems/type-of-triangle

Intuition

Do what the question asks.

Approach

Do what the question asks.

Complexity

  • Time complexity: $O(1)$

  • Space complexity: $O(1)$

Code

class Solution:
    def triangleType(self, nums: List[int]) -> str:
        nums.sort()
        if nums[0] + nums[1] <= nums[2]:
            return "none"
        elif nums[0] == nums[1] == nums[2]:
            return "equilateral"
        elif nums[0] == nums[1] or nums[1] == nums[2]:
            return "isosceles"
        return "scalene"

image.png

For more Solutions, please visit my website.