title: Algorithm for finding all paths in a NxN grid
body: <p>Imagine a robot sitting on the upper left hand corner of an NxN grid. The robot can only move in two directions: right and down. How many possible paths are there for the robot?</p>
  
  <p>I could find solution to this problem on Google, but I am not very clear with the explanations. I am trying to clearly understand the logic on how to solve this and implement in Java. Any help is appreciated.</p>
  
  <p>Update: This is an interview question. For now, I am trying to reach the bottom-right end and print the possible paths.</p>