Write a Program to find out Whether a given String can be a Palindrome i.e. we need to see for the palindrome after rearranging the words in that string.
example: lets say we have a string “aabbccd” so it can be a palindrome after rearranging the words “abcdcba”.
For this you need to find out the optimal solution.
