title: How to determine if a string can be manipulated to be rewritten as a palindrome?
body: <p>I believe this can be achieved by counting the instances for each character in that string. Even if a single character in that string is repeated at least twice, we can declare that string as a palindrome.</p>
  
  <p>For example: bbcccc can be rewritten as bccccb or ccbbcc.
  edified can be rewritten as deified.</p>
  
  <p>Some book mentioned we should be using hash table. I think we can just use a list and check for the character count.</p>
  
  <p>Do you think the logic is correct?</p>