Mohit Garg
Currently a student, in final semester at IIIT Gwalior of 5 year Integrated course in IT. Working on my thesis on Cellular Neural networks, special kind of ANN. Interested to work with a high end software development group. Also looking out to go for PhD in areas of machine Learning and Intelligent systems. Right now being offered 2 mediocre placements, one at Amdocs, other at Persistent Systems.
- » Resume
No dynamic programming , no catalan. Its a simple counting problem. Answer is C( 2(n-1), n-1 )
- Mohit Garg April 20, 2008Explanation: If we assume the initial location is [1,1], the robot has to move n-1 steps to right and n-1 down. This problem can be seen as making 2 groups of size n-1 out of 2n-2.