Solving Jump Game problems on leetcode

Jump Game — Medium

Given an array of non-negative integers nums, you are initially positioned at the first index of the array.

Jump Game II

Given an array of non-negative integers nums, you are initially positioned at the first index of the array.

Jump Game III

Given an array of non-negative integers arr, you are initially positioned at start index of the array. When you are at index i, you can jump to i + arr[i] or i - arr[i], check if you can reach to any index with value 0.

Jump Game IV

Given an array of integers arr, you are initially positioned at the first index of the array.

  • i - 1 where: i - 1 >= 0.
  • j where: arr[i] == arr[j] and i != j.

Looking for opportunities in software development. Interested in Blockchain, distributed computing and back-end development.