Leetcode Problem 2428. Maximum Sum of an Hourglass

2428. Maximum Sum of an Hourglass

Leetcode Solutions

Brute Force Hourglass Sum

  1. Initialize a variable maxSum to store the maximum hourglass sum found.
  2. Loop through the matrix using two nested loops, with indices i and j, skipping the last two rows and columns to avoid index out of bounds.
  3. At each position (i, j), calculate the sum of the hourglass pattern.
  4. Update maxSum if the current hourglass sum is greater than the previously recorded maximum.
  5. Continue until all possible hourglass positions have been checked.
  6. Return maxSum as the result.
UML Thumbnail

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...