Palindrome String Validation

Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.

Note:

The string 'S' should be evaluated in a case-insensitive manner.

Example:

Input:

"c1 O$d@eeD o1c"

Output:

"Yes"

Explanation:

After removing special characters and spaces, and converting to lowercase, the string becomes "c1odeedo1c", which is a palindrome.

Input:

The first input line contains an integer 'T', the number of test cases.
Each of the following 'T' lines contains the string 'S'.

Output:

For each test case, print "Yes" if 'S' is a palindrome or "No" if it's not, on a new line.

Constraints:

• 1 ≤ T ≤ 100
• 1 ≤ Length(S) ≤ 10⁴
• The time limit for processing is 1 second.