Solutions for find the max_sum value in the 2D array matrix w.r.t to the hourglass figure…


#include<iostream>
#include<climits>

using namespace std;

const int R = 6;
const int C = 6;

int findMaxSum(int array[R][C]){

    int max_sum = INT_MIN;
    for(int i = 0; i<R-2; i++){
      for(int j = 0; j<C-2; j++) {
        int sum = (array[i][j]+array[i][j+1]+array[i][j+2]+array[i+1][j+1]+array[i+2][j]+array[i+2][j+1]+array[i+2][j+2]);
        max_sum = max(max_sum, sum);
      }
    }
    return max_sum;
}

int main() {

  int array[R][C];
  for(int i = 0; i<R; i++){
    for(int j = 0; j<C; j++){
      cin>>array[i][j];
    }
  }

  int res = findMaxSum(array);
  return res;
}