# Problem :

You are given a 6 * 6  2D array. An hourglass in an array is a portion shaped like this:

``````a b c
d
e f g
``````

``````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
``````

Actually, there are many hourglasses in the array above. The three leftmost hourglasses are the following:

``````1 1 1     1 1 0     1 0 0
1         0         0
1 1 1     1 1 0     1 0 0
``````

The sum of an hourglass is the sum of all the numbers within it. The sum for the hourglasses above are 7, 4, and 2, respectively.

In this problem you have to print the largest sum among all the hourglasses in the array.

Input Format

There will be exactly  lines, each containing  integers seperated by spaces. Each integer will be between  and  inclusive.

Output Format

Print the answer to this problem on a single line.

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

The hourglass which has the largest sum is:

``````2 4 4
2
1 2 4``````

### Java 2D Array – Hacker Rank Solution

```import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int arr[][] = new int;
for(int arr_i=0; arr_i < 6; arr_i++){
for(int arr_j=0; arr_j < 6; arr_j++){
arr[arr_i][arr_j] = in.nextInt();
}
}
Sum(arr);
}
private  static void Sum(int arr[][]){
//ROw
int sum=-1000;
for(int i =0 ; i<4;i++){
for(int x =0 ; x<4; x++){
int top = arr[i][x]+arr[i][x+1]+arr[i][x+2];
int middle = arr[i+1][x+1];
int bottom = arr[i+2][x]+arr[i+2][x+1]+arr[i+2][x+2];
if(top+middle+bottom>sum){sum=top+middle+bottom;}
}
}
System.out.println(sum);
}
}```

Disclaimer: The above Problem (Java 2D Array) is generated by Hackerrank but the Solution is Provided by Chase2Learn. This tutorial is only for Educational and Learning purposes. Authority if any of the queries regarding this post or website fill the following contact form thank you.