[NEW ALGORITHM] : Jump Game problem

[Jivanjamadar]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name: Jump Game problem

[NEW ALGORITHM]

About:

The Jump Game problem is a well-known problem that can be solved with backtracking, dynamic programming, or a greedy approach.

Given an array of non-negative integers nums, where each element represents the maximum jump length you can make from that position, determine if you can reach the last index starting from the first index.

###Example:
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.

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1
new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

[Jivanjamadar]

@pankaj-bind assign this issue to me