[FEATURE REQUEST] <JUMP Game Greedy problem>

[Mochoye]

What would you like to Propose?

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

Return true if you can reach the last index, or false otherwise.

Issue details

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.

Return true if you can reach the last index, or false otherwise.

Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Additional Information

I want to contribute on this issue for Hacktoberfest

[Rohxn16]

HI, I can work on this problem can I be assigned with this issue?

[vil02]

It seems to be a leetcode like problem. Please note:

Java/CONTRIBUTING.md

Line 3 in 9dde8a7

NOTE: *We DO NOT add leetcode problems. They are just applications of basic principles that can be found in other algorithms included in the repository.*