Algorithm
Equal Sum Grid Partition I
Solution
class Solution:
def hasEqualPartition(self, grid: List[List[int]]) -> bool:
m, n = len(grid), len(grid[0])
total_sum = sum(sum(row) for row in grid)
if total_sum % 2 != 0:
return False
target = total_sum // 2
current_sum = 0
for i in range(m - 1):
current_sum += sum(grid[i])
if current_sum == target:
return True
current_sum = 0
for j in range(n - 1):
current_sum += sum(grid[i][j] for i in range(m))
if current_sum == target:
return True
return FalseVideo GuideLeetcode Daily
Time Complexity
O(M * N)
Space Complexity
O(1)
