title: Convert string to palindrome string with minimum insertions
body: <p>In order to find the minimal number of insertions required to convert a given string(s) to palindrome I find the longest common subsequence of the string(lcs_string) and its reverse. Therefore the number of insertions to be made is length(s) - length(lcs_string)</p>
  
  <p>What method should be employed to find the equivalent palindrome string on knowing the number of insertions to be made?</p>
  
  <p>For example : </p>
  
  <p>1) azbzczdzez</p>
  
  <p>Number of insertions required : 5
  Palindrome string : azbzcezdzeczbza</p>
  
  <p>Although multiple palindrome strings may exist for the same string but I want to find only one palindrome?</p>