Given a string S, Check if characters of the given string can be rearranged to form a palindrome.
For example characters of “geeksogeeks” can be rearranged to form a palindrome “geeksoskeeg”, but characters of “geeksforgeeks” cannot be rearranged to form a palindrome.
First line consists of integer T denoting the number of test cases. T testcases follow. For each testcase there are one line of input containing string S.
For each testcase, in a new line, print "Yes" if is possible to make it a palindrome, else "No".
1 <= T <= 100
1 <= |S| <= 1000
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.