Problems of greedy algorithm are usually intuitively challenging. For this one, the high level concept is “while already able to jump (global), stay behind the accessible point and seek greedier choice (local)”.
Description
