Added solution for Jump game (55) using Dynamic Programming (codedecks-in#217)

* Added solution for Jump game (55) using Dynamic Programming

* Edited README.md

Author: shreyventure

Python/jumpGame.py

@@ -0,0 +1,34 @@
+# 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.
+
+# Input: nums = [3,2,1,0,4]
+# Output: false
+# Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
+
+'''
+    Time Complexity: O(n),
+    Space Complexity: O(n)
+'''
+
+def canJump(nums):
+    ptr1 = len(nums) - 1
+    ptr2 = ptr1 - 1
+
+    while ptr2 >= 0:
+        if nums[ptr2] >= ptr1 - ptr2:
+            ptr1 = ptr2
+            ptr2 -= 1
+        else :
+            ptr2 -= 1
+
+    if ptr1 == 0:
+        return True
+    else:
+        return False
+
+print(canJump[3,2,1,0,4])

README.md

@@ -394,6 +394,7 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 174  | [Dungeon Game](https://leetcode.com/problems/dungeon-game/)                                                         | [C++](./C++/dungeon-game.pp)                              | _O(M\*N)_ | _O(M\*N)_ | Hard       | Dynamic Programming  |      |
 | 070  | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)                                                   | [Java](./Java/climbing-stairs.java)                       | _O(N)_    | _O(1)_    | Easy       | DP                   |      |
 | 730  | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences/) | [C++](./C++/Count-Different-Palindromic-Subsequences.cpp) | _O(N\*N)_ | _O(N\*N)_ | Hard       | DP                   |      |
+| 55   | [Jump Game](https://leetcode.com/problems/jump-game/)                                                               | [Python](./Python/jumpGame.py)                            | _O(N)_    | _O(N)_    | Medium     | DP                   |      |
 
 <br/>
 <div align="right">
@@ -510,6 +511,7 @@ DISCLAIMER: This above mentioned resources have affiliate links, which means if
 | [Sachin_Upadhyay](https://github.com/sachsbu) <br> <img src="https://avatars.githubusercontent.com/u/24941685?v=4" width="100" height="100">                                                                   | India          | Java                  |  [GitHub](https://github.com/sachsbu)   
 | [Amisha Sahu](https://github.com/Amisha328) <br> <img src = "https://avatars.githubusercontent.com/u/58816552?v=4" width="100" height="100"> | India | C++ | [CodeChef](https://www.codechef.com/users/amisha328)<br/>[LeetCode](https://leetcode.com/Mishi328/)<br/>[HackerRank](https://www.hackerrank.com/amishasahu328)
 | [Shrimadh V Rao](https://github.com/Shrimadh) <br> <img src="https://avatars.githubusercontent.com/u/64469917?v=4" width="100" height="100">                                                                   | India          | C++                  |  [GitHub](https://github.com/Shrimadh)
+| [Shreyas Shrawage](https://github.com/shreyventure) <br> <img src = "https://avatars.githubusercontent.com/u/55741087?v=4" width="100" height="100"> | India | Python | [CodeChef](https://www.codechef.com/users/shreyventure)<br/>[LeetCode](https://leetcode.com/shreyventure/)<br/>[HackerRank](https://www.hackerrank.com/shreyas_shrawage)
 | [Surbhi Mayank](https://github.com/surbhi2408) <br> <img src="https://avatars.githubusercontent.com/u/58289829?s=400&u=68fd396819b927ec4d8820d87d6d1e311c3abd01&v=4" width="100" height="100">                                                                   | India          | C++                  |  [GitHub](https://github.com/surbhi2408)
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>