Day 11 2D Arrays

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[6][6];
        for(int i=0; i < 6; i++){
            for(int j=0; j < 6; j++){
                arr[i][j] = in.nextInt();
            } 
        } 
     int h=largestSum(arr);
     System.out.println(h); 
    }  
    
    public static int largestSum(int[][] arr) 
        { 
        int h=Integer.MIN_VALUE; 
       
           for(int i=0;i<arr.length-2;i++)
               {
           for(int j=0; j<arr.length-2; j++)
               {
                   int s=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]; 
                    if(h<s)
                     {
                        h=s; 
                     }
    
               }
           }
            return h; 
         
          }  
        
}