1895. Largest Magic Square: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1427,3 +1427,4 @@ mod s1888_minimum_number_of_flips_to_make_the_binary_string_alternating;
 mod s1889_minimum_space_wasted_from_packaging;
 mod s1893_check_if_all_the_integers_in_a_range_are_covered;
 mod s1894_find_the_student_that_will_replace_the_chalk;
+mod s1895_largest_magic_square;

src/solution/s1895_largest_magic_square.rs

@@ -0,0 +1,74 @@
+/**
+ * [1895] Largest Magic Square
+ *
+ * A k x k magic square is a k x k grid filled with integers such that every row sum, every column sum, and both diagonal sums are all equal. The integers in the magic square do not have to be distinct. Every 1 x 1 grid is trivially a magic square.
+ * Given an m x n integer grid, return the size (i.e., the side length k) of the largest magic square that can be found within this grid.
+ *  
+ * Example 1:
+ * <img alt="" src="https://assets.leetcode.com/uploads/2021/05/29/magicsquare-grid.jpg" style="width: 413px; height: 335px;" />
+ * Input: grid = [[7,1,4,5,6],[2,5,1,6,4],[1,5,4,3,2],[1,2,7,3,4]]
+ * Output: 3
+ * Explanation: The largest magic square has a size of 3.
+ * Every row sum, column sum, and diagonal sum of this magic square is equal to 12.
+ * - Row sums: 5+1+6 = 5+4+3 = 2+7+3 = 12
+ * - Column sums: 5+5+2 = 1+4+7 = 6+3+3 = 12
+ * - Diagonal sums: 5+4+3 = 6+4+2 = 12
+ *
+ * Example 2:
+ * <img alt="" src="https://assets.leetcode.com/uploads/2021/05/29/magicsquare2-grid.jpg" style="width: 333px; height: 255px;" />
+ * Input: grid = [[5,1,3,1],[9,3,3,1],[1,3,3,8]]
+ * Output: 2
+ *
+ *  
+ * Constraints:
+ *
+ * 	m == grid.length
+ * 	n == grid[i].length
+ * 	1 <= m, n <= 50
+ * 	1 <= grid[i][j] <= 10^6
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/largest-magic-square/
+// discuss: https://leetcode.com/problems/largest-magic-square/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn largest_magic_square(grid: Vec<Vec<i32>>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1895_example_1() {
+        let grid = vec![
+            vec![7, 1, 4, 5, 6],
+            vec![2, 5, 1, 6, 4],
+            vec![1, 5, 4, 3, 2],
+            vec![1, 2, 7, 3, 4],
+        ];
+
+        let result = 3;
+
+        assert_eq!(Solution::largest_magic_square(grid), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1895_example_2() {
+        let grid = vec![vec![5, 1, 3, 1], vec![9, 3, 3, 1], vec![1, 3, 3, 8]];
+
+        let result = 2;
+
+        assert_eq!(Solution::largest_magic_square(grid), result);
+    }
+}