The first line of input contains a single integer T, representing the number of test cases or queries to be run. Then the T test cases follow. The first line of each test case contains a positive integer N, which represents the number of shops. The next line contains 'N' single space-separated positive integers representing a constant given for each shop.
For each test case, print the minimum number of jumps or -1, if it is impossible to reach the last shop.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 10 1 <= N <= 5 * 10^4 0 <= Arr[i] <= N Where T is the number of test cases, N is the size of the array and Arr[i] is the ith element in the array.
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End