Leetcode 3546. Equal Sum Grid Partition I

Given an m×n grid of positive integers, determine whether a single horizontal or vertical cut between rows or columns can split the grid into two non-empty parts with equal sums — equivalently, check if any row-prefix sum or column-prefix sum equals half the total.