Leetcode 2498. Frog Jump II

Given sorted stone positions on a line, find the minimum possible maximum jump length for a frog that must go from the first stone to the last and then back to the first while visiting any intermediate stone at most once. The challenge is to choose a round-trip ordering that minimizes the largest absolute jump between consecutive stones.