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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3546. Equal Sum Grid Partition I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact