I have solved the problem in Python 3

arr = []

# Read the 6x6 array
for _ in range(6):
    arr.append(list(map(int, input().split())))

max_sum = -10**9  # Important: handle all-negative cases

for i in range(4):
    for j in range(4):
        hourglass_sum = (
            arr[i][j] + arr[i][j+1] + arr[i][j+2] +
            arr[i+1][j+1] +
            arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]
        )
        max_sum = max(max_sum, hourglass_sum)

print(max_sum)

`

hourglass_sums = []\n for i in range(4): for j in range(4): first_row = arr[i][j] + arr[i][j+1] + arr[i][j+2] second_row = arr[i+1][j+1] third_row = arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2] sum = first_row + second_row + third_row hourglass_sums.append(sum) print(max(hourglass_sums))

Here is Day 11: 2D Arrays problem solution - https://programmingoneonone.com/hackerrank-day-11-2d-arrays-30-days-of-code-solution.html

Python3 Solution

import math import os import random import re import sys

if name == 'main':

arr = []

for _ in range(6):
    arr.append(list(map(int, input().rstrip().split())))
# print(arr)

max_hg =  curr_hg = float('-inf')

for i in range(4):
    for j in range(4):
        first_row = arr[i][j] + arr[i][j+1] + arr[i][j+2]
        second_row = arr[i+1][j+1]
        third_row = arr[i+2][j] + arr[i+2][j+1] + arr[i+2][j+2]
        curr_hg = first_row + second_row + third_row

        if curr_hg > max_hg:
            max_hg = curr_hg

print(max_hg)