algorithm - Calculating number of moves from top left corner to bottom right with move in any direction - Stack Overflow
There is a robot situated at (1,1) in a N X N grid, the robot can move in any direction left, right ,up and down. Also I have been given an integer k, which denotes the maximum steps in the path. I had to calculate the number of possible ways to move from (1,1) to (N,N) in k or less steps.
Read full article from algorithm - Calculating number of moves from top left corner to bottom right with move in any direction - Stack Overflow
There is a robot situated at (1,1) in a N X N grid, the robot can move in any direction left, right ,up and down. Also I have been given an integer k, which denotes the maximum steps in the path. I had to calculate the number of possible ways to move from (1,1) to (N,N) in k or less steps.
Read full article from algorithm - Calculating number of moves from top left corner to bottom right with move in any direction - Stack Overflow