Dynamic Programming, Programming, Algorithms, Data, Coding Interviews.
is the same i.e. (M + N)!/(N!)(M!). Recursive solution: We can reach the cell (M, N) from (N-1, M) and (N, M-1) cells. So the total number of ways to reach (M, N)th cell = total number of ways to reach (N-1, M) th cell + the total number of ways to reach (N-1, M)th cell => pathCount(N,M) =