Hackerrank | 30 days of code | Day 11-Solution in c++| 2D-Arrays-hackerrank-Solution-in-c++

Hackerrank | 30 days of code | Day 11-Solution in c++| 2D-Arrays-hackerrank-Solution-in-c++

https://www.hackerrank.com/challenges/30-2D-arrays/problem

Day 11: 2D Arrays Solution in Cpp

#include <iostream>
#include <vector>

using namespace std;

int main() {
    vector<vector<int>> arr(6, vector<int>(6));
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            cin >> arr[i][j];
        }
    }

    int max = -9 * 7;
    for (int i = 0; i < 6; i++) {
        for (int j = 0; j < 6; j++) {
            if (j + 2 < 6 && i + 2 < 6) {
                int sum = 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 (sum > max) max = sum;
            }
        }
    }

    cout << max;

    return 0;
}