Jump Game I Solution

It all begins with an idea. Maybe you want to launch a business. Maybe you want to turn a hobby into something more. Or maybe you have a creative project to share with the world. Whatever it is, the way you tell your story online can make all the difference.

Don’t worry about sounding professional. Sound like you. There are over 1.5 billion websites out there, but your story is what’s going to separate this one from the rest. If you read the words back and don’t hear your own voice in your head, that’s a good sign you still have more work to do.

Be clear, be confident and don’t overthink it. The beauty of your story is that it’s going to continue to evolve and your site can evolve with it. Your goal should be to make it feel right for right now. Later will take care of itself. It always does.

Python Java C++

def can_jump_from_position(position, nums):
    """Check if you can jump to the end starting from the current position."""
    if position == len(nums) - 1:
        return True
    furthest_jump = min(position + nums[position], len(nums) - 1)
    for next_position in range(position + 1, furthest_jump + 1):
        if can_jump_from_position(next_position, nums):
            return True
    return False

def can_jump(nums):
    """Wrapper function to check if we can jump to the last index."""
    return can_jump_from_position(0, nums)

public class JumpGame {
    public static boolean canJumpFromPosition(int position, int[] nums) {
        // Check if current position is the last index
        if (position == nums.length - 1) return true;
        int furthestJump = Math.min(position + nums[position], nums.length - 1);
        for (int nextPosition = position + 1; nextPosition <= furthestJump; nextPosition++) {
            if (canJumpFromPosition(nextPosition, nums)) return true;
        }
        return false;
    }

    public static boolean canJump(int[] nums) {
        return canJumpFromPosition(0, nums);
    }
}

#include 
using namespace std;

bool canJumpFromPosition(int position, const vector& nums) {
    // Check if current position is the last index
    if (position == nums.size() - 1) return true;
    int furthestJump = min(position + nums[position], (int)nums.size() - 1);
    for (int nextPosition = position + 1; nextPosition <= furthestJump; nextPosition++) {
        if (canJumpFromPosition(nextPosition, nums)) return true;
    }
    return false;
}

bool canJump(const vector& nums) {
    return canJumpFromPosition(0, nums);
}