i need code for finding all possible combination of repetitive characters using recursion function.
actually the question i s "Imagine a robot sitting on upper left corner of NxN grid. the robot can only move in two direction "Right" and "Down". write a recursive function to find all possible paths that are there for robot?
the above highlighted line is the logic i figured out but i am not able to convert it to C code.
n=3. then there are total 6 possible paths.
so, basicaly i want a recursive function which can do this for any value of N.?