Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Choose K Elements With Maximum Sum
Coding
- Difference Between Maximum and Minimum Price Sum
Coding
- Find the Maximum Sum of Node Values
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 2428. Maximum Sum of an Hourglass
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source