HackerRank 2D Array DS solution in Python

Today we are going to solve the HackerRank 2D array DS problem using python programming language. Given a 6×6 2D array, arr, an hourglass is a subset of values with indices falling in the following pattern:

a b c
d
e f g
There are 16 hourglasses in a 6×6 array. The hourglass sum is the sum of the values in an hourglass. Calculate the hourglass sum for every hourglass in arr, then print the maximum hourglass sum.

Problem solution in Python

ar = []
for i in range(6):
    ar.append(list(map(int, input().split())))

def get_hg(x, y):
    hg = []
    xend = x+3
    for i in range(y, y+3):
        if i == y + 1:
            hg.append([0, ar[i][x+1],0])
        else:
            hg.append(ar[i][x:xend])

    return hg

hg = []
for x in range(3 + 1):
    for y in range(3 + 1):
        hg.append(get_hg(x, y))

hgsums = []
for h in hg:
    s = 0
    for j in h:
        s += sum(j)
    hgsums.append(s)

print(max(hgsums))

HackerRank 2D Array DS solution in Python 2.

# Enter your code here. Read input from STDIN. Print output to STDOUT
DIM = 6

matrix = []

def hourglass(r, c):
    return matrix[r][c] + sum(matrix[r - 1][c - 1: c + 2]) + sum(matrix[r + 1][c - 1: c + 2])

for i in range(DIM):
    matrix.append(map(int, raw_input().split()))

hourglass_vals = []
for r in range(1, 5):
    for c in range(1, 5):
        hourglass_vals.append(hourglass(r, c))
        
print max(hourglass_vals)