Make that a Palindrome

Problem Statement

Make that a Palindrome Problem Description Alice and Bob are playing a game with strings. Initially, both of them have a string consisting of lowercase Latin letters. Bob asks Alice to remove all characters from her string that are also present in Bob's string. And then check if Alice's string can be rearranged to form a Palindrome. A Palindrome is a word that reads the same backward as forwards. Input format First line: TC (Number of test cases) Next 2 * TC lines: Two strings S and T of Alice and Bob respectively. Output format For each test case, print "YES" (without quotes) if the remaining string can be rearranged to form a Palindrome, else print "NO" (without quotes). Constraints 1 1 1 Examples Example 1: Input: 1 abccdeee abceef Output: YES Explanation: We will remove 1 'a', 1 'b', 1 'c' and 2 'e' from Alice's String. Since there's no 'Y' in Alice's string, we will leave it as it is. After rearranging, new string = 'ede' which is a palindrome.