LeetCode 55 Jump Game - Why Naive Fails

Try all possible jump paths with recursion or BFS.

With $n$ positions and max jump $k$, the number of paths can be exponential.

Memoization helps but adds $O(n)$ space. Can you do better?