Recursion Rat in a Maze (Count and print)

Rat in a Maze (Recursion Backtracking)

Given M*N matrix, with some cells as blocked, you have to
a) find path from source to destination
b) count no. of paths from source to destination
c) print all possible paths

Given --> rat can move only forward and down

I am not able to solve part b) ie:- count the number of paths from source to destination

Please implement that in the above ide

hi @ayushmittal628_58414ee9c56e4875
refer this code -->

hi @ayushmittal628_58414ee9c56e4875
I hope it’s clear now??

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.