GoalScope — maximal_square (Qwen2.5-Coder-32B-Instruct) — hover a token to see the patched verbalization
↵
<code>↵
def maximal_square(matrix):↵
"""Dynamic programming approach to find the largest square containing only 1s."""↵
if not matrix:↵
return 0↵
m, n = len(matrix), len(matrix[0])↵
dp = [[0] * (n + 1) for _ in range(m + 1)]↵
max_side = 0↵
for i in range(1, m + 1):↵
for j in range(1, n + 1):↵
if matrix[i - 1][j - 1] == '1':↵
dp[i][j] = min(dp[i - 1][j], dp[i][j - 1], dp[i - 1][j - 1]) + 1↵
max_side = max(max_side, dp[i][j])↵
return max_side * max_side↵
</code>