title: Get Palindrome of a String with replacement
body: <p>Elina has a string S, consisting of lowercase English alphabetic letters(ie. a-z). She can replace any character in the string with any other character, and she can perform this replacement any number of times. she wants to create a palindromic string, p , from s such that string p contains the sub string linkedin . it is guaranteed that Elina can create palindromic string p from S.
  find the minimum number of operation required to create palindromic string p from S.
  Sample test case are:</p>
  
  <p>First test case: S="linkedininininin"</p>
  
  <p>explanation :   </p>
  
  <pre><code>            linkedin (i) (n) (i) (n) (i) ni (n)
  
                       (n) (i) (d) (e) (k)    (l)  
  
              p =  "linkedinnideknil" 
  </code></pre>
  
  <p>output is   6</p>
  
  <p>Second test case:  S="fulrokxeuolnzxltiiniabudyyozvulqbydmaldbxaddmkobhlplkaplgndnksqidkaenxdacqtsskdkdddls"</p>
  
  <p>output is  46</p>
  
  <p>here i was unable to get second test case output, how it's getting output 46.</p>
  
  <p>Third Test Case: </p>
  
  <pre><code>              S="linkaeiouideknil"
  
                P="linkedinnideknil" 
      Output = 4 
  </code></pre>