Solutions to the problems that were solved in September 2014.
Problem 1.
Given a string of alphabets, determine whether a palindrome can be formed by rearranging the letters of the string.
For example, the string ‘abaab’ can be rearranged as ‘ababa’ to form a palindrome whereas the string ‘acccaa’ cannot be rearranged to form a palindome.