Given a vector of lengths [a b c], determines whether a triangle with non-zero area (in two-dimensional Euclidean space, smarty!) could have sides of those lengths.
Examples:
[1 2 1000] ---> false
[3 4 5] ---> true
[5 5 5] ---> true
Tests with sides that are not sorted should be added.
no range??
I wanted to try out the Hankel here. This is more than necessary. It checks to see that the sum of all pairs of sides are greater than the remaining side. You really only need to do this to compare against the maximum length side.
This is just bad, only gaming the test suit. There is nothing to be learned from this.
worst solution ,i have ever seen
Added to test suite to eliminate this "solution".
Maximum running product for a string of numbers
816 Solvers
Implement simple rotation cypher
806 Solvers
138 Solvers
264 Solvers
328 Solvers