D. J.:

- Added leetcode problem and solution for 45 Jump Game II

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/)
+- [45 Jump Game II](https://leetcode.com/problems/jump-game-ii/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/)

awesome_python_leetcode/_45_jump_game_II.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    def jump(self, nums: List[int]) -> int:
+        """
+        You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].
+
+        Each element nums[i] represents the maximum length of a forward jump from index i. In other words,
+        if you are at nums[i], you can jump to any nums[i + j] where:
+        - 0 <= j <= nums[i] and i + j < n
+
+        Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].
+        """
+
+        left, right, jumps = 0, 0, 0
+        while right < len(nums) - 1:
+            largest_jump = 0
+            for i in range(left, right + 1):
+                largest_jump = max(largest_jump, i + nums[i])
+            left = right + 1
+            right = largest_jump
+            jumps += 1
+        return jumps

tests/test_45_jump_game_II.py

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