We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
python:
def hourglassSum(arr):
l=[]
for i in range(1,5):
for j in range(1,5):
l.append(a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+
a[i][j]+
a[i+1][j-1]+a[i+1][j]+a[i+1][j+1])
return(max(l))
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
2D Array - DS
You are viewing a single comment's thread. Return to all comments →
python: def hourglassSum(arr): l=[] for i in range(1,5): for j in range(1,5): l.append(a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+ a[i][j]+ a[i+1][j-1]+a[i+1][j]+a[i+1][j+1]) return(max(l))