Equal Sum Grid Partition II
You are given an m x n matrix grid of positive integers.
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:
Return true if such a partition exists; otherwise, return false.
Note: A section is connected if every cell in it can be reached from any other cell by moving up, down, left, or right through other cells in the section.
Example 1
Input: grid = [[1,4],[2,3]]
Output: true
Example 2
Input: grid = [[1,2],[3,4]]
Output: true
Example 3
Input: grid = [[1,2,4],[2,3,5]]
Output: false
Example 4
Input: grid = [[4,1,8],[3,2,6]]
Output: false
Explanation: No valid cut exists, so the answer is false .
Constraints
- 1 <= m == grid.length <= 10^5
- 1 <= n == grid[i].length <= 10^5
- 2 <= m * n <= 10^5
- 1 <= grid[i][j] <= 10^5
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.