We are given N squares number 0 to N – 1. Each square has target jump square J[i] (which must be at a larger index). At square i, you can only jump to square J[i]. If J[i] is past the last square, then you are done.

We are given N squares number 0 to N – 1. Each square has target jump square J[i] (which must be at a larger index). At square i, you can only jump to square J[i]. If J[i] is past the last square, then you are done.

I am trying to solve the problem it works for positive integers array but fails for negative test case, kindly suggest me to handle the below test case