Question

Given a matrix where every cell has some number of coins. count number of ways to reach bottom right from top left with exactly k coins. we can move to (i+1, j) and (i, j+1) from a cell (i, j).

Answer 1

yes that is very true cause we ballin