Repozitory Technologies Pvt Ltd | OA Round Coding Problems & Solutions | 2022 | CodeQuotient | Hourglass - 2D Array: Sub-Matrix Traversal and Max Sum

Problem Statement: Hourglass - 2D Array The Objective: Given a 6×6 2D Array, find the maximum "hourglass sum" among all possible hourglasses in the grid. What is an Hourglass? An hourglass is a subset of values with indices falling in this graphical representation: Plaintext   a b c d e f g There are exactly 16 hourglasses in a 6×6 array. Task: Calculate the hourglass sum for every hourglass in the array, then print the maximum hourglass sum. Example Walkthrough ...