Question

Count possible paths in an mXn matrix from top left to bottom right?

Answer 1

class Tree {static int numberOfPaths(int a, int b)    {if (a == 1 || b == 1)return 1;return numberOfPaths(a- 1, b) + numberOfPaths(a, b - 1);      }public static void main(String args[])    {System.out.println(numberOfPaths(3, 3));    }}