Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Equal Sum Grid Partition II
Coding
- Partition Array Into Three Parts With Equal Sum
Coding
- Partition Equal Subset Sum
Coding · 0-1 Knapsack · Array · Dynamic Programming
- Partition to K Equal Sum Subsets
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3546. Equal Sum Grid Partition I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source