This is a medium level problem on leetcode and also a part of Striver's A to Z DSA Sheet/Course, which can be solved using a greedy algorithm.
We use an approach which calculates the maximum reachable distance at any given index and determine if we can reach the last Index.
Link to the problem: https://leetcode.com/problems/jump-game/
Other problems for practice:
https://youtu.be/WBHt2u-FbaA
https://youtu.be/_-egcADXcVA
https://youtu.be/qsVLIJi2q9M
https://youtu.be/ICumod5MnP0
https://youtu.be/VGpamsI5hOM
https://youtu.be/FyRdNhOqxY0
https://youtu.be/TogMQREMyTs
https://youtu.be/J5azLaXh0JM
https://youtu.be/xW2vzZSw1bs
