GfG QA is closing soon... Please refer PRACTICE or GfG now on wards !!


Given a n*m grid we have to start from the top left and reach the bottom right collecting maximum points.Further move from bottom right to top left therby collecting maximum points which were not collected earlier.The final answer will be the sum of both it should be maximum.

I tried using dp and backtracking but I think it won't work for certain cases.

Could someone possibly explain how to do it?


asked Jul 31, 2016 by Pallavi 1 flag