title: Check if a permutation of a string can become a palindrome
body: <blockquote>
    <p>Write a method to test if a string meets the preconditions to become a palindrome.</p>
    
    <p>Eg:</p>
  
  <pre><code>Input    | Output
  mmo      | True  
  yakak    | True  
  travel   | False
  </code></pre>
  </blockquote>
  
  <p>I'm thinking of this approach:</p>
  
  <ol>
  <li>Make a suffix tree for all permutation of T such that T$Reverse(T)#</li>
  <li>Check for all permutation for same node</li>
  </ol>
  
  <p>Am I missing anything?</p>