For a rectangular grid having a x b cells as shown in the below figure:-
![]()
Find the number of shortest paths along the edge of the cells. Starting from the bottom-left point and end at right-up point.
For simplicity they are marked as (0,0) and (a,b)
Write a pseudo code to print all such
paths.
Find Solution here