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.
# Iterate through the array, excluding the border
for i in range(len(arr) - 2):
for j in range(len(arr[i]) - 2):
# Compute the sum of the hourglass
current_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]
# Update max_sum if needed
max_sum = max(max_sum, current_sum)
return max_sum
arr = []
for _ in range(6):
arr.append(list(map(int, input().rstrip().split())))
print(hourglass_sum(arr))
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Day 11: 2D Arrays
You are viewing a single comment's thread. Return to all comments →
python solution :
def hourglass_sum(arr): max_sum = float('-inf')
arr = [] for _ in range(6): arr.append(list(map(int, input().rstrip().split())))
print(hourglass_sum(arr))