<commit_before><commit_msg>Add solution to 2D Arrays problem<commit_after>import java.util.*;
import java.io.*;

class ArrayDS2D {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a[][] = new int[6][6];
		for(int i = 0; i < 6; i++) {
			for(int j = 0; j < 6; j++) {
				a[i][j] = sc.nextInt();
			}
		}
		int max = a[0][0] + a[0][1] + a[1][1] + a[0][2] + a[2][0] + a[2][1] + a[2][2];
		int hourglass;
		for(int i = 0; i < 4; i++) {
			for(int j = 0; j < 4; j++) {
				hourglass = a[i][j] + a[i][j+1] + a[i][j+2] + a[i+1][j+1] + a[i+2][j] + a[i+2][j+1] + a[i+2][j+2];
				if(hourglass > max)
					max = hourglass;
			}
		}
		System.out.println(max);
	}
}
{'fraction_non_alphanumeric': 0.2575976845151954, 'fraction_numerical': 0.05065123010130246, 'mean_word_length': 3.046783625730994, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 4, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6531243', 'n_tokens_mistral': 372, 'n_tokens_neox': 332, 'n_words': 74}