for i=1 to n
for j=1 to n
coins[i][j]=coins[i][j]+ max(coins[i-1][j],coins[i][j-1]);
This is a bottom up DP. Time complexity O(n^2)-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
