interview-techdev-guide
interview-techdev-guide copied to clipboard
Goldmine in Dynamic Programming
You are given a 2-D matrix of with each box containing weights at each location. You have to find the maximum gold that can be obtained while moving from source to destination.
@jenistenxavier can i solve this?