title: find the lexicographically minimal string rotation without suffix tree and in O(n)
body: <p>how to find the index in an circular array such that the string that is formed starting from that index is first in lexicographic order.</p>
  
  <p>For Ex : in the circular array ABCDEABCCDE
  The answer is 6 because the circular string starting from the element A in the 6th position comes first in the dictionary formed from all the possible strings of the circular array.</p>