Jump Game
Medium Accuracy: 49.57% Submissions: 16589 Points: 4

Given an positive integer N and a list of N integers A[]. Each element in the array denotes the maximum length of jump you can cover. Find out if you can make it to the last index if you start at the first index of the list.

Example 1:

N = 6
A[] = {1, 2, 0, 3, 0, 0} 
Jump 1 step from first index to
second index. Then jump 2 steps to reach 
4th index, and now jump 2 steps to reach
the end.

Example 2:

N = 3
A[] =  {1, 0, 2}
You can't reach the end of the array.

Your Task:
You don't need to read input or print anything. Your task is to complete the function canReach() which takes a Integer N and a list A of size N as input and returns 1 if the ned of the array is reachable, else return 0.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

1 <= N <= 105
1 <= A[i] <= 105

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Jump Game

Output Window