So if the given array is like, then the answer will be true as, the frog can jump to the 1 unit to 2nd stone, 2 units to 3rd stone, then again 2 units to 4th stone, then 3 units to 6th stone, 4 units to 7th stone and finally 5 units to 8th stone. And frog can only jump in the forward direction. When the frog's current jump was k units, then its next jump must be either k - 1, k, or k + 1 units. Initially, the frog is on the first stone and assume the first jump must be of 1 unit. Here we have a list of stones' positions in sorted ascending order sequence, we have to check whether the frog is able to cross the river by landing on the last stone, or not. The frog can jump on a stone, but not water.

The river is divided into x units and at each unit there may be a stone. We have to move the green frogs from the left to the right and move the bro. Suppose there is a frog that is crossing a river. Share build artifacts & dependencies from development to production with a complete DevOps Platform, including artifact management, pipeline security. There are six frogs, there are in green color and other three are in brown color.

Frog leap solution