{

int jumps = 1;

int smallestIndex = index;

for (int i = index; i >= 0; --i)

{

if (i + nums[i] >= index)

smallestIndex = min(smallestIndex, i);

}

if (!smallestIndex)

return jumps;

return jumps + minimumJumps(nums, smallestIndex);

{

if (1 == nums.size())

return 0;

return minimumJumps(nums, nums.size() - 1);

{

int reach = 0, count = 0, last = 0; // reach: maximum reachable index from current position

// count: number of jumps made so far

// last: rightmost index that has been reached so far

for (int i = 0; i < nums.size() - 1; i++) { // loop through the array excluding the last element

reach = max(reach, i + nums[i]); // update reach to the maximum between reach and i+nums[i]

if (i == last) { // if i has reached the last index that can be reached with the current number of jumps

last = reach; // update last to the new maximum reachable index

count++; // increment the number of jumps made so far

}

}

return count; // return the minimum number of jumps required

{

vector<int> nums = { 2,3,1,1,4 };

//int res = jump(nums);

int res = jumpBetter(nums);

std::cout << "Hello World!\n";