Given an m*n matrix, find the total number of paths from top-left (0,0) to bottom-right (m-1,n-1) moving only down or right, and write a routine to print all of those valid paths.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.