Count Square Submatrices with All Ones | Dynamic Programming | Leetcode 1277

Can we solve this question using recurrsion by memoisation

Today I participated in LC weekly contest 421 and able to come up with a solution for Q 2 in O(N^2) tc ... got TLE :(

Now finally i can see some progress in the DSA journey ..all thanks to you sirJi :)

very clear explanation