D. J.:

- Added the leetcode problem and solution for 55. Jump Game

Author: nobodyPerfecZ

README.md

@@ -6,6 +6,7 @@ This repository contains awesome LeetCode problems and solutions written in Pyth
 
 - [26 Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)
 - [27 Remove Element](https://leetcode.com/problems/remove-element/description/)
+- [55 Jump Game](https://leetcode.com/problems/jump-game/description/)
 - [80 Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/)
 - [88 Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/description/)
 - [121 Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)

awesome_python_leetcode/_55_jump_game.py

@@ -0,0 +1,16 @@
+from typing import List
+
+
+class Solution:
+    def canJump(self, nums: List[int]) -> bool:
+        """
+        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.
+        """
+        goal = len(nums) - 1
+        for i in range(len(nums) - 1, -1, -1):
+            if i + nums[i] >= goal:
+                goal = i
+        return True if goal == 0 else False

tests/test_55_jump_game.py

@@ -0,0 +1,17 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._55_jump_game import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "expected"],
+    argvalues=[
+        ([2, 3, 1, 1, 4], True),
+        ([3, 2, 1, 0, 4], False),
+    ],
+)
+def test_func(nums: List[int], expected: List[int]):
+    can_jump = Solution().canJump(nums)
+    assert can_jump == expected