I think the task condition is written incorrectly. "A frog cannot jump out of an array" how to understand how many jumps it should do to understand that it still cannot jump out of an array??!!! my stack was overloaded because the frog could jump back and forth endless for given condition [1,-1]

For a triangle, the sum of any two sides must be greater than the third. Then why does it write to me that the triangle on the side 2,2,8 should be isosceles?