title: Can anybody solve this programming challenge?
body: <p>Can anybody solve the following question using the programming language Go?</p>
  
  <blockquote>
    <p>James got hold of a love letter that his friend Harry has written for
    his girlfriend. Being the prankster that James is, he decides to
    meddle with it. He changes all the words in the letter into
    palindromes.</p>
    
    <p>While modifying the letters of the word, he follows 2 rules:</p>
    
    <ol>
    <li><p>He always reduces the value of a letter, e.g. he changes 'd' to
    'c', but he does not change 'c' to 'd'. </p></li>
    <li><p>If he has to repeatedly
    reduce the value of a letter, he can do it until the letter becomes
    'a'. Once a letter has been changed to 'a', it can no longer be
    changed.</p></li>
    </ol>
    
    <p>Each reduction in the value of any letter is counted as a single
    operation. Find the minimum number of operations he carries out to
    convert a given string into a palindrome. </p>
    
    <h3>Input Format</h3>
    
    <p>The first line contains an integer T, i.e., the number
    of test cases.  The next T lines will contain a string each.</p>
    
    <h3>Output Format</h3>
    
    <p>A single line containing the number of minimum
    operations corresponding to each test case.</p>
    
    <h3>Constraints</h3>
    
    <p>1 ≤ T ≤ 10 1 ≤ length of string ≤ 104  All characters are
    lower cased.</p>
    
    <h3>Sample Input</h3>
    
    <p>#00 3 abc abcba abcd</p>
    
    <h3>Sample Output</h3>
    
    <p>#00 2 0 4</p>
    
    <h3>Explanation</h3>
    
    <p>For the first test case, ab*c* -> ab*b* -> ab*a*.  For the
    second test case, abcba is a palindromic string.  For the third test
    case, abc*d* -> abc*c* -> abc*b* -> abc*a* = ab*c*a -> ab*b*a.</p>
  </blockquote>
  
  <p>The puzzle is taken from HackerRank.com I am a golang newbie and couldn't solve the puzzle using the language.</p>