Leetcode 1895. Largest Magic Square

Find the largest side length k of any k×k subgrid whose every row sum, every column sum, and both diagonal sums are equal (entries need not be distinct). With m,n ≤ 50 the core challenge is efficiently testing all candidate squares—typically by enumerating sizes/positions and using prefix sums to verify row, column and diagonal sums quickly.