Problem can be found in here!
Solution: Greedy
def jump(nums: List[int]) -> int:
start = end = step = 0
while end < len(nums) - 1:
step += 1
start, end = end+1, max(i+nums[i] for i in range(start, end+1))
return stepTime Complexity: , Space Complexity: