3418. Maximum Amount of Money Robot Can Earn | DP on Grids | Top Down Approach

In this video, I'll talk about how to solve Leetcode 3418. Maximum Amount of Money Robot Can Earn | DP on Grids | Top Down Approach
DP on Grid1 - • Number of Increasing P...
DP on Grid2 - • 3393. Count Paths With...
CODE - CODE - leetcode.com/p...
Let's Connect:
X Twitter : x.com/aryan_mi...
📱Discord (Join Community) : / discord
📝Linkedin (About me): / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
📱Telegram : t.me/aryan_mit...
🤖 Github: github.com/ary...
✨ Timelines✨
0:00 - Problem Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@kbcoder3734]

Superb solution, I spent more than 1 hour on this problem during the contest while using 2-d DP.

[@harshbhardwaj8112]

Same here

[@shauryatomer1058]

thanks for the great explanation, was able to come with complete solution, only thing left was didn't think separate base case would be required for i = m - 1 && j = n - 1.

[@DarkDragon-bz6qp]

Thanks Great explanation..For interviews if i explain till memoization will it be enough?or i need to use bottom up approach?

[@25-cse-csmohitkumarmandal59]

If you able to solve memorization, you will able to solve bottom up already (once watch Love Babbar 's DP series) (If q. Is easy-moderate)

[@DarkDragon-bz6qp]

​@@25-cse-csmohitkumarmandal59okk

[@whyyshivam]

Another approach I thought of is : Calculate the total sum from (0,0) till (m−1,n−1), including negative values. During the traversal, track the two smallest (most negative) values. In the final answer, add the absolute values of these two smallest negatives to the total sum. Is this approach correct?

[@kumkumslab5811]

no because you can't track which path you have selected so might be possible that 2 min elements are not the part of that path

[@Its_Shubham_Negi]

Thanks ❤

[@aryavyadav9345]

Was able to solve this question during the contest thankfully 😊

[@NeelakshiSachdeva]

Can I do dp without doing recursion?? Actually somebody told me to do recursion first as dp follows but even after spending 2 weeks I'm not getting recursion totally. Can u pls guide if dp can be done independently.or not?

[@aryavyadav9345]

@@NeelakshiSachdeva DP can be done without recursion, that method is called tabulation where loops are involved. However, I highly suggest you to follow through learning recursion. Try doing striver's SDE sheet's recursion questions and watch his vids on those questions. You can also check out Love Babbar's C++ course. Recursion is very important as it has applications in higher data structures like trees and graphs. Also , an update now that the rating has been updated on leetcode. It turns out leetcode rejected my solution on this question since it gave TLE on the 577 test case.

[@kodurisaivishnu4916]

i have got an idea to solve this problem but ,Failed to handle the Base case. Does AnyOne With same problem ?

[@BruceWayne-lm6xt]

yes me toooo

[@dipanshubose-u9b]

Yeah just forgot the case where theres is a robber at the destination cell

[@nikhilprakash729]

nice..

[@KedarBhawthankar]

you explain very well but i dont understand

[@DarkDragon-bz6qp]

Found this question tough

[@kbcoder3734]

Same

[@staywithmeforever]

Atmost 2 cells is the worse