You are viewing a single comment's thread. Return to all comments →
From my HackerRank solutions.
Make sure not to initialize max value to 0 to pass all test cases.
import java.util.Scanner; public class Solution { public static void main(String [] args) { Scanner scan = new Scanner(System.in); int arr[][] = new int[6][6]; for (int row = 0; row < 6; row++) { for (int col = 0; col < 6; col++) { arr[row][col] = scan.nextInt(); } } scan.close(); System.out.println(maxHourglass(arr)); } public static int maxHourglass(int [][] arr) { int max = Integer.MIN_VALUE; for (int row = 0; row < 4; row++) { for (int col = 0; col < 4; col++) { int sum = findSum(arr, row, col); max = Math.max(max, sum); } } return max; } private static int findSum(int [][] arr, int r, int c) { int sum = arr[r+0][c+0] + arr[r+0][c+1] + arr[r+0][c+2] + arr[r+1][c+1] + arr[r+2][c+0] + arr[r+2][c+1] + arr[r+2][c+2]; return sum; } }
Let me know if you have any questions.
Seems like cookies are disabled on this browser, please enable them to open this website
Java 2D Array
You are viewing a single comment's thread. Return to all comments →
Java solution - passes 100% of test cases
From my HackerRank solutions.
Make sure not to initialize max value to 0 to pass all test cases.
Let me know if you have any questions.