Python Easy solution Bruteforce
\nBruteforce -->\n1. First sort the list and reverse it so that you can have the largest number at the start of the lisit.\n2. Then traverse the list till len(n
\nBruteforce -->\n1. First sort the list and reverse it so that you can have the largest number at the start of the lisit.\n2. Then traverse the list till len(nums)-2 because you are going to take 3 numberse into consideration.\n3. Then we have to check the simple condition and rule of tranges ie. --> The sum of the two sides of the triangle is always smaller than the third side.\n4. If all the condition meet then we have to return the sum of the three sides of the triange.\n5. The three sides of the triangle are the 1st, 2nd and the 3rd element and they will always be the largest because we have sorted it in thre reverse order.\n\n![image](https://assets.leetcode.com/users/images/c584c62d-e263-4e30-849f-cc670169e10f_1665592727.4565024.png)\n\n\n        nums.sort(reverse = True)\n        for i in range(len(nums)-2):\n            if nums[i] < nums[i+1] + nums[i+2]:\n                return nums[i] + nums[i+1] + nums[i+2]\n        return 0\n\nAnother way of writing the same code -->\n![image](https://assets.leetcode.com/users/images/8e14b15c-a266-4581-b091-1c63863074e0_1665592747.352271.png)\n\n
['Python']