Frog Jump

Given sorted stone positions and an initial jump of 1, determine whether a frog can reach the last stone when each jump length must be k-1, k, or k+1 from the previous jump. The core challenge is exploring reachable jump sizes per stone under position gaps — typically solved with dynamic programming/DFS using a map/set of stones to reachable jump lengths.