Assuming that u can either move down or right, Using Dynamic Programming,
a DP equation can be framed like this : Paths[i][j] = paths[i][j-1] + paths[i-1][j] By filling the entire matrix, result will be in Paths[m-1][n-1]. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
