Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

Given an array/list 'ARR' of integers and a position ‘M’. You have to reverse the array after that position.

Example:

```
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}.
```

Detailed explanation

```
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
```

```
1. Try to think by creating another array
2. Try to think which elements are beign swapped.
```