Problem - Jump Game

Array where nums[i] is the max jump length from index i. Can you reach the last index starting from index $0$? Example: [2,3,1,1,4]. From $0$, jump to $1$ or $2$. From $1$, jump up to $3$ positions.

You can reach index $4$.

Example: [3,2,1,0,4]. From $0$, jump to $1$, $2$, or $3$.

But all paths lead to index $3$ where you are stuck. What is the greedy approach? Constraint: $n \le 10^4$ means $O(n)$ time using $O(1)$ space greedy beats $O(2^n)$ backtracking.