We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This is my CPP Solution
what i did was traverse the 2D array in an hourglass form using 2 loops. As the last 2 indices of both i and j can't make an hourglass shape, so we run the loop till the first 4.
int hourglassSum(vector> arr) {
int maxSum=INT_MIN;
int sum;
for(int i=0;i<4;i++){
for(int j=0 ; j<4; j++){
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>maxSum) maxSum=sum;
}
}
return maxSum;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
2D Array - DS
You are viewing a single comment's thread. Return to all comments →
This is my CPP Solution what i did was traverse the 2D array in an hourglass form using 2 loops. As the last 2 indices of both i and j can't make an hourglass shape, so we run the loop till the first 4. int hourglassSum(vector> arr) { int maxSum=INT_MIN; int sum; for(int i=0;i<4;i++){ for(int j=0 ; j<4; j++){ 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>maxSum) maxSum=sum; } } return maxSum; }