Back to home

Multidimensional Arrays

Multidimensional Arrays

Multidimensional Arrays Notes

Traversal Based Problems

0% completed

Search in a row wise and column wise sorted matrix

Matrix Is Symmetric

Matrix Flip Bit

Spiral Matrix

Find nth elements of spiral matrix

Rotation Based Problems

0% completed

Rotate matrix to the right

Inplace rotate matrix 90 degree

Mixed Problems

0% completed

Matrix Median

Empty Cells in a Matrix

Return in Row wave form

Maximum 1s

Minimum Sum in matrix

Summed Matrix

Print All K x K

Reset Matrix

Sub query sum

Array sum

Find rank

Problem

Submissions

Solution

New

Discuss

8

Avg. time to solve

20 min

Success Rate

80%

Problem Statement

Suggest Edit

```
Right rotation on a matrix is shifting each column to the right side (the last column moves to the first column) and 'K' times means performing this rotation 'K' times.
```

```
For 'K' = 1 and the given 'MAT':
1 2 3
4 5 6
7 8 9
Output after rotating 'MAT' one time is:
3 1 2
6 4 5
9 7 8
```

```
The first line of input contains an integer 'T' representing the number of test cases.
The first line of each test case contains three single space-separated integers ‘N’, ‘M’, and ‘K’, respectively. ‘N’ and ‘M’ represent the rows and columns of the matrix and ‘K’ denotes the number of right rotations to be performed.
Then each of the next 'N' lines of each test case contains 'M' single space-separated integers representing the elements in a row of the matrix.
```

```
For each test case, return the elements of the matrix row-wise after rotation in a single line.
```

```
You don't need to print the output, It has already been taken care of. Just implement the given function.
```

```
1 <= T <= 10
1 <= N <= 200
1 <= M <= 200
0 <= K <= 10^9
1 <= MAT[i][j] <= 10^5
Where 'MAT[i][j]' denotes the element in the 'i'th row and 'j'th column of the matrix.
It is guaranteed that sum of 'N' * 'M' over all the test cases does not exceed 10 ^ 5.
Time limit: 1 sec
```

```
2
3 3 2
10 20 30
40 50 60
70 80 90
2 2 2
1 2
3 4
```

```
20 30 10 50 60 40 80 90 70
1 2 3 4
```

```
In test case 1, Performing right rotation for the first time ('K' = 1) we get:
30 10 20
60 40 50
90 70 80
Performing right rotation for the second time ('K' = 2) we get:
20 30 10
50 60 40
80 90 70
The matrix after rotations will be printed in a single line row-wise. Therefore, the output is:
20 30 10 50 60 40 80 90 70
In test case 2, Performing right rotation for the first time ('K' = 1) we get:
2 1
4 3
Performing right rotation for the second time ('K' = 2) we get:
1 2
3 4
The matrix after rotations will be printed in a single line row-wise. Therefore, the output is:
1 2 3 4
```

```
2
2 3 2
1 2 3
4 5 6
4 4 1
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16
```

```
2 3 1 5 6 4
4 1 2 3 8 5 6 7 12 9 10 11 16 13 14 15
```

```
In test case 1, Performing right rotation for the first time ('K' = 1) we get:
3 1 2
6 4 5
Performing right rotation for the second time ('K' = 2) we get:
2 3 1
5 6 4
The matrix after rotations will be printed in a single line row-wise. Therefore, the output is:
2 3 1 5 6 4
In test case 2, Performing right rotation for the first time ('K' = 1) we get:
4 1 2 3
8 5 6 7
12 9 10 11
16 13 14 15
The matrix after rotations will be printed in a single line row-wise. Therefore, the output is:
4 1 2 3 8 5 6 7 12 9 10 11 16 13 14 15
```

Java (SE 1.8)

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Show Hint

Saving Code...

Full Screen Mode

Change Theme

Solution submission not allowed

Save Code

Reset Code