title: alternative approach to count number of rotation required to find original string from rotated string
body: <p>WE got 2 strings one correct and one its rotation? we have to tell that after how many steps of rotation of 2nd string we get the original (first)string(suppose only one side rotation is allowed)</p>
  
  <p>but problem here is traditional method of rotating one charater of string at a time and then comparing rotated  string with original is taking more time than allowed 
  which alternative approach can be used?</p>
  
  <p>string1: <code>david</code>
  string2: <code>vidda</code></p>
  
  <p>(processing part-rotation first: <code>avidd</code>, second: <code>david</code>, so answer is 2)
  output: <code>2</code></p>