Launching My First Demo Web App Online - Mindteck One Portal

Mindteck One Portal

Hello Coders, How you all doing ? Speaking of which, I am just trying to enjoy the Beautiful Weather of Bangalore, the best thing about is the frequent climate change! You no never when you gown stuck in the rain, or in a blazing sun!

Beauty always Prevails here!
Personally I am loving it.

So, until now you guys are thinking that this article's just started taking a U turn, out of sudden. We suppose to talk about my New Portal! Isn't it right?

Yes, We are just about to hit the floor.
Past Few Weeks, I have been working Part Time on this Portal.      

Our Company going to Launch this One Signed in thing, that means for logging in into any of the services  you need to use the same credential.

Before the RnD Team jump off and start working on it, they wanted a demo from the person who have come up with Idea in the first place.

Hackarank 2D Array GlassHour Problem - Java Solution

Hello Coders,
I am posting this code for my future reference.
Below is the problem statement!

Task
Calculate the hourglass sum for every hourglass in , then print the maximum hourglass sum.

Input Format

There are  lines of input, where each line contains  space-separated integers describing 2D Array ; every value in will be in the inclusive range of  to .

Constraints

Output Format

Print the largest (maximum) hourglass sum found in .

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

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 a[][] = new int[6][6];