add 2946

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -7,6 +7,7 @@
 | 2960 | [Count Tested Devices After Test Operations](https://leetcode.com/problems/count-tested-devices-after-test-operations/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2960.java)                                       |                                      | Easy                                     |
 | 2956 | [Find Common Elements Between Two Arrays](https://leetcode.com/problems/find-common-elements-between-two-arrays/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2956.java)                                       |                                      | Easy                                     |
 | 2951 | [Find the Peaks](https://leetcode.com/problems/find-the-peaks/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2951.java)                                       |                                      | Easy                                     |
+| 2946 | [Matrix Similarity After Cyclic Shifts](https://leetcode.com/problems/matrix-similarity-after-cyclic-shifts/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2946.java)                                       |                                      | Easy                                     |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                                     |
 | 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                                     |
 | 2932 | [Maximum Strong Pair XOR I](https://leetcode.com/problems/maximum-strong-pair-xor-i/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2932.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2946.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2946 {
+    public static class Solution1 {
+        public boolean areSimilar(int[][] mat, int k) {
+            int m = mat.length;
+            int n = mat[0].length;
+            k %= n;
+            if (k == 0) {
+                return true;
+            }
+            int[][] updated = new int[m][n];
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    //regardless i is even or odd, it's the same formula below!
+                    updated[i][(j + k) % n] = mat[i][j];
+                }
+            }
+            for (int i = 0; i < m; i++) {
+                if (!Arrays.equals(mat[i], updated[i])) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2946Test.java

@@ -0,0 +1,38 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions.thirdthousand._2946;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+public class _2946Test {
+    private static _2946.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2946.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertTrue(solution1.areSimilar(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2,1,2],[5,5,5,5],[6,3,6,3]"), 2));
+    }
+
+    @Test
+    public void test2() {
+        assertTrue(solution1.areSimilar(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[3,10,3,10,3,10,3,10],[5,8,5,8,5,8,5,8],[3,9,3,9,3,9,3,9],[3,8,3,8,3,8,3,8],[2,3,2,3,2,3,2,3]"), 2));
+    }
+
+    @Test
+    public void test3() {
+        assertTrue(solution1.areSimilar(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[9,5,3,10],[4,7,10,7],[1,7,9,4],[8,8,1,6],[6,7,6,1],[3,1,1,8],[9,2,8,3],[1,9,7,6]"), 4));
+    }
+
+    @Test
+    public void test4() {
+        assertTrue(solution1.areSimilar(CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[9,1,8,9,2,9,1,8,9,2],[10,2,7,8,9,10,2,7,8,9],[7,6,6,9,5,7,6,6,9,5]"), 5));
+    }
+
+}