Leetcode 2428. Maximum Sum of an Hourglass

Find the maximum sum of any fixed 7-cell "hourglass" shape (three cells in a top row, the middle cell of the next row, and three cells in the bottom row) placed entirely inside an m×n integer grid. m,n are between 3 and 150 and grid values are small nonnegative integers.

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 2428. Maximum Sum of an Hourglass

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact