{"size": 816, "ext": "js", "max_stars_repo_path": "HackerRank/2D Array - DS.js", "max_stars_repo_name": "ielvisd/CodeWar_Katas", "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "HackerRank/2D Array - DS.js", "max_issues_repo_name": "ielvisd/CodeWar_Katas", "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "HackerRank/2D Array - DS.js", "max_forks_repo_name": "ielvisd/CodeWar_Katas", "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null}
{"max_stars_count": null, "max_issues_count": null, "max_forks_count": null, "avg_line_length": 17.7391304348, "max_line_length": 215, "alphanum_fraction": 0.631127451}
// Given a  2D Array, :

// 1 1 1 0 0 0
// 0 1 0 0 0 0
// 1 1 1 0 0 0
// 0 0 0 0 0 0
// 0 0 0 0 0 0
// 0 0 0 0 0 0

// An hourglass in  is a subset of values with indices falling in this pattern in 's graphical representation:

// a b c
//   d
// e f g

// There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every arr hourglass in , then print the maximum hourglass sum. The array will always be 6 x 6.

// Sample Input

// 1 1 1 0 0 0
// 0 1 0 0 0 0
// 1 1 1 0 0 0
// 0 0 2 4 4 0
// 0 0 0 2 0 0
// 0 0 1 2 4 0

// Sample Output

// 19

// Explanation

// arr contains the following hourglasses:

// The hourglass with the maximum sum (19) is:

// 2 4 4
//   2
// 1 2 4

// Complete the hourglassSum function below.

function hourglassSum(arr) {}


