Added Python solution for "Maximum Sum of an Hourglass"

Author: Kyrylo-Ktl

Python/Maximum Sum of an Hourglass.py

@@ -0,0 +1,22 @@
+from typing import List
+
+
+class Solution:
+    """
+    Time:   O(n*m)
+    Memory: O(n*m)
+    """
+
+    def maxSum(self, grid: List[List[int]]) -> int:
+        n, m = len(grid), len(grid[0])
+        return max(
+            self.get_hourglass(grid, i, j)
+            for i in range(1, n - 1)
+            for j in range(1, m - 1)
+        )
+
+    @staticmethod
+    def get_hourglass(grid: List[List[int]], i: int, j: int) -> int:
+        return grid[i - 1][j - 1] + grid[i - 1][j] + grid[i - 1][j + 1] + \
+                                    grid[i][j] + \
+               grid[i + 1][j - 1] + grid[i + 1][j] + grid[i + 1][j + 1]