[2428] Maximise Hour glass sum

Author: Chhavi Bansal

LeetcodeProblems/Algorithms/2428.Hour_Glass_Sum.js LeetcodeProblems/Algorithms/Maximise_Hour_Glass_Sum.js

@@ -3,13 +3,28 @@
 
 You are given an m x n integer matrix grid.
 We define an hourglass as a part of the matrix with the following form:
+For Input : [[6,2,1],[4,2,1],[9,2,8]]
+The Hourglass sum would be => 6 + 2 + 1 + 2( 2nd row , 2nd column) + 9 + 2 + 8
+
 Return the maximum sum of the elements of an hourglass.
 
 Note that an hourglass cannot be rotated and must be entirely contained within the matrix.
+
+Constraints:
+
+m == grid.length
+n == grid[i].length
+3 <= m, n <= 150
+0 <= grid[i][j] <= 106
+
 Input: grid = [[6,2,1,3],[4,2,1,5],[9,2,8,7],[4,1,2,9]]
 Output: 30
+Explanation: The cells shown above represent the hourglass with the maximum sum: 6 + 2 + 1 + 2 + 9 + 2 + 8 = 30.
 
 
+Input: grid = [[1,2,3],[4,5,6],[7,8,9]]
+Output: 35
+Explanation: There is only one hourglass in the matrix, with the sum: 1 + 2 + 3 + 5 + 7 + 8 + 9 = 35.
 */
 
 /**

LeetcodeProblemsTests/Algorithms/Maximise_Hour_Glass_Sum.js

@@ -0,0 +1,9 @@
+const assert = require('assert');
+const maxSum = require('../../LeetcodeProblems/Algorithms/Maximise_Hour_Glass_Sum').maxSum;
+
+function test() {
+  assert.equal(maxSum([[6,2,1,3],[4,2,1,5],[9,2,8,7],[4,1,2,9]]));
+  assert.equal(maxSum([[1,2,3],[4,5,6],[7,8,9]]));
+}
+
+module.exports.test = test

README.md

@@ -79,7 +79,7 @@ To run a specific problem in your console run  `node <problem_file_path>` (e.g.
 | [Permutations With Duplicates ](/LeetcodeProblems/Algorithms/Permutations_With_Duplicates.js)                   |        | |
 | [Deletion Distance](/LeetcodeProblems/Algorithms/Deletion_Distance.js)                                          |        | |
 | [Award Budget Cuts](/LeetcodeProblems/Algorithms/Award_Budget_Cuts.js)                                          |        | |
-
+| [Maximum Sum of an Hourglass](/LeetcodeProblems/Algorithms/Maximise_Hour_Glass_Sum.js)                          | Medium | https://leetcode.com/problems/maximum-sum-of-an-hourglass/ |
 ### Sorting Algorithms
 | Algoritmhs |
 |      -     |