3148. Maximum Difference Score in a Grid | Top Down + Bottom Up | Weekly Leetcode 397

[@bt6415]

Mistakenly, I only considered the adjacent cells in my top-down solution, and it got accepted. I think iit was possible to explore all opportunities for a given cell using a single step rather than using a for loop inside the recursion.

[@raghavendrac4710]

Thank you!

[@user-ti7jb6xp4n]

Very Nice explanation

[@raghavendrac4710]

Sir please make a video on hard problem of yesterday and today's contest.

[@codingmohan]

Here you go - ua-cam.com/video/y2C5sOgZdvI/v-deo.html
Yesterday's one I am still thinking whether to make or not as that was more of ad-hoc and might not actually help.

[@codingmohan]

There were lot of request for the 4th one, so here you go - ua-cam.com/video/ku2RBhkBBIw/v-deo.html

[@subhamcoder]

Sir yesterday's last questions ka video kijiya

[@codingmohan]

Here you go - ua-cam.com/video/ku2RBhkBBIw/v-deo.html

[@subhamcoder]

@@codingmohan thank you