1886 matrix very good rotation transpose in/not inplace functions

Given two n x n binary matrices mat and target, return true if it is possible to make mat equal to target by rotating mat in 90-degree increments, or false otherwise.

 

Example 1:


Input: mat = [[0,1],[1,0]], target = [[1,0],[0,1]]
Output: true
Explanation: We can rotate mat 90 degrees clockwise to make mat equal target.
Example 2:


Input: mat = [[0,1],[1,1]], target = [[1,0],[0,1]]
Output: false
Explanation: It is impossible to make mat equal to target by rotating mat.
Example 3:


Input: mat = [[0,0,0],[0,1,0],[1,1,1]], target = [[1,1,1],[0,1,0],[0,0,0]]
Output: true
Explanation: We can rotate mat 90 degrees clockwise two times to make mat equal target.
 

Constraints:

n == mat.length == target.length
n == mat[i].length == target[i].length
1 <= n <= 10
mat[i][j] and target[i][j] are either 0 or 1.

Seen this question in a real interview before?
1/5
Yes
No
Accepted
70.7K
Submissions
124K
Acceptance Rate
57.0%
Topics
Array
Matrix
Companies
Hint 1
What is the maximum number of rotations you have to check?
Hint 2
Is there a formula you can use to rotate a matrix 90 degrees?

Author: Gauranshgoel123

determine-whether-matrix-can-be-obtained-by-rotation.java

@@ -0,0 +1,58 @@
+class Solution {
+    public boolean findRotation(int[][] matrix, int[][] target) {
+        //check upto 3 times coz we can rotate any matrix by 90degrees atmost 3 times only
+        for(int k=0;k<4;k++){
+            matrix=transpose(matrix);
+            matrix=revrow(matrix);
+            if(eqq(matrix,target)==true){
+                return true;
+            }
+        }
+        return false;
+    }
+    public static int[][] transpose(int[][] matrix){
+        // int[][] ans=new int[matrix[0].length][matrix.length];
+        // for(int i=0;i<matrix.length;i++){
+        //     for(int j=0;j<matrix[0].length;j++){
+        //         ans[i][j]=matrix[j][i];
+        //     }
+        // }
+        // return ans;
+        int n=matrix.length;
+        int temp=0;
+        for(int i=0;i<n-1;i++){
+            for(int j=i+1;j<n;j++){
+                temp = matrix[i][j];
+                matrix[i][j] = matrix[j][i];
+                matrix[j][i] = temp;
+            }
+        }
+        return matrix;
+    }
+    public static int[][] revrow(int[][] matrix){
+        int n=matrix.length;
+        for(int i=0;i<n;i++){
+            int start = 0;
+            int end = n-1;
+            while (start < end) {
+                int temp1 = matrix[i][start];
+                matrix[i][start] = matrix[i][end];
+                matrix[i][end] = temp1;
+                start++;
+                end--;
+            }
+        }
+        return matrix;
+    }
+    public static boolean eqq(int[][] matrix, int[][] target){
+        int n=matrix.length;
+        for(int i=0;i<n;i++){
+            for(int j=0;j<matrix[0].length;j++){
+                if(target[i][j]!=matrix[i][j]){
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+}