Add problem 2943: Maximize Area of Square Hole in Grid

Author: EFanZh

src/lib.rs

@@ -2021,6 +2021,7 @@ pub mod problem_2937_make_three_strings_equal;
 pub mod problem_2938_separate_black_and_white_balls;
 pub mod problem_2942_find_words_containing_character;
 pub mod problem_2943_maximize_area_of_square_hole_in_grid;
+pub mod problem_2946_matrix_similarity_after_cyclic_shifts;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_2946_matrix_similarity_after_cyclic_shifts/brute_force.rs

@@ -0,0 +1,29 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn are_similar(mat: Vec<Vec<i32>>, k: i32) -> bool {
+        mat.iter().all(|row| {
+            let n = row.len();
+
+            row.iter().eq(row.iter().skip(k as u32 as usize % n).chain(row).take(n))
+        })
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn are_similar(mat: Vec<Vec<i32>>, k: i32) -> bool {
+        Self::are_similar(mat, k)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_2946_matrix_similarity_after_cyclic_shifts/mod.rs

@@ -0,0 +1,23 @@
+pub mod brute_force;
+
+pub trait Solution {
+    fn are_similar(mat: Vec<Vec<i32>>, k: i32) -> bool;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+    use crate::test_utilities::Matrix;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[[1, 2, 3], [4, 5, 6], [7, 8, 9]] as &dyn Matrix<_>, 4), false),
+            ((&[[1, 2, 1, 2], [5, 5, 5, 5], [6, 3, 6, 3]], 2), true),
+            ((&[[2, 2], [2, 2]], 3), true),
+        ];
+
+        for ((mat, k), expected) in test_cases {
+            assert_eq!(S::are_similar(mat.to_vec(), k), expected);
+        }
+    }
+}