Mirror String Problem Statement

Given a string S containing only uppercase English characters, determine if S is identical to its reflection in the mirror.

Example:

Input:

S = "AMAMA"

Output:

YES

Explanation:

The string S is the same as its mirror reflection.

Input:

The first line contains an integer T, representing the number of test cases.
The subsequent T lines each contain a string 'S'.

Output:

For each test case, output a single line with "YES" if the string 'S' is the same as its mirror reflection, or "NO" otherwise.
Output for each test case should be on a separate line.

Constraints:

• 1 <= T <= 10
• 1 <= Length(S) <= 10^5
• Time limit: 1 second

Note:

The function should return a boolean indicating if the string is identical to its mirror reflection; it does not need to print directly.