title: Minimum steps to win Snake Ladder
body: <p>Given a snake and ladder game, write a function that returns the minimum number of jumps to take top or destination position. 
  You can assume the die you throws results in always favor of you</p>
  
  <p>**</p>
  
  <blockquote>
    <p>Here is my solution, but not sure it's correct or not.</p>
    
    <p>This problem is similar to frog jump in an array.But before that we
    will have to model the problem in that format.</p>
    
    <p>Create an array of size 100 and for each position store 6 if there is
    no snake or ladder. store jump count . if ladder is present at that
    point . If snake is present then store -ve jump at that location.</p>
    
    <p>Now we have to solve in how many minimum steps we can reach till end.
    Main problem can be solved using dynamic programing in O(n^2) time
    complexity and O(n ) space.</p>
  </blockquote>