Jump Game - Walkthrough

Example: [2,3,1,1,4]. $1.$ i= $0$: furthest = max($0$, $0$+$2$) = $2$.

$2.$ i= $1$: $1$ <= $2$, reachable. furthest = max($2$, $1$+$3$) = $4$.

$3.$ furthest= $4$ >= $n-1$= $4$. Done! Return true.

Example: [3,2,1,0,4]. $1.$ i= $0$: furthest = $3$.

$2.$ i= $1$: furthest = max(3, 3) = $3$.

$3.$ i= $2$: furthest = max(3, 3) = $3$.

$4.$ i= $3$: furthest = max(3, 3) = $3$.

$5.$ i= $4$: $4$ > $3$. Cannot reach. Return false. Notice we detect failure the moment we try to visit an unreachable index.