Maximum Sum of Hour Glass | GFG POTD | C++ | Java | Code Kar Lo

Given two integers n, m and a 2D matrix mat of dimensions nxm, the task is to find the maximum sum of an hourglass.
0:00 Introduction
0:15 Problem Statement
1:26 Explanation
6:30 C++ Code
8:25 Java Code
My DSA Journey:- • How Did I Learn Data S...
How to Earn By GFG Articles:- • How to Write Article o...
Infosys Coding Questions:- • Infosys Coding Questions
Problem Link:-www.geeksforgeeks.org/problem...
Code Link:-github.com/ShubhamKashyap138/...
Playlist Link:- • Geeks for Geeks POTD
Linkedin:- / shubham-kashyap-65a29a218
Instagram:- im_shubham_kash...
My GFG Profile:- auth.geeksforgeeks.org/user/s...
gfg potd
gfg potd today
gfg problem of the day
potd gfg
potd
potd today
gfg
#dsa #datastructures #algorithm #gfg #potd #coding #array #strings #tree #binarysearchtree #codekarlo #dynamicprogramming