3548. Equal Sum Grid Partition II
php
dev.to
3548. Equal Sum Grid Partition II Difficulty: Hard Topics: Principal, Array, Hash Table, Matrix, Enumeration, Prefix Sum, Weekly Contest 449 You are given an m x n matrix grid of positive integers. Your task is to determine if it is possible to make either one horizontal or one vertical cut on the grid such that: Each of the two resulting sections formed by the cut is non-empty. The sum of elements in both sections is equal, or can be made equal by discounting at most one single cell in tot