Problem of the day
We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0
based indexing so the subarray {5, 6} will be reversed and our
output array will be {1, 2, 3, 4, 6, 5}.
The very first line of input contains an integer βTβ denoting the number of test cases.
The first line of every test case contains one integer βNβ where βNβ denotes the number of elements and an integer βMβ which denotes after which position the array has to be reversed.
The second line of every test case contains βNβ space-separated integers which denote the elements of input of array/list.
For each test case, return the required array.
Output for each test case is printed on a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
Consider 0-based indexing of the array.
1 <= T <= 10
0 <= M <= N <= 5*10^4
-10^9 <= ARR[i] <= 10^9
Time Limit: 1 sec
2
6 3
1 2 3 4 5 6
5 2
10 9 8 7 6
1 2 3 4 6 5
10 9 8 6 7
For the first test case,
Considering 0-based indexing we have M = 3 so the
subarray[M+1 β¦ N-1] has to be reversed.
Therefore the required output will be {1, 2, 3, 4, 6, 5}.
For the second test case,
Considering 0-based indexing we have M = 2 so the
subarray[M+1 β¦ N-1] has to be reversed.
Therefore the required output will be {10, 9, 8, 6, 7}.
2
7 3
1 4 5 6 6 7 7
9 3
10 4 5 2 3 6 1 3 6
1 4 5 6 7 7 6
10 4 5 2 6 3 1 6 3