Plz provide the code

#1

Given a m*n grid and number of stones in each cell Robot starts from first row and ends up in the last row and moves from row to row by visiting exactly one cell in each row From one row to other, (1+1, j-1), (i+1, j) and (i+1, j+1) , find a path with maximum no of stones

#2

@raghavvij30 do you have the link to this problem?

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.