Last Updated: 25 Jan, 2021
Mirror String
Easy
Asked in companies
You are given a string S containing only uppercase English characters. Find whether S is the same as its reflection in the mirror.
For Example, S = “AMAMA” is the same as its reflection in the mirror.
Input Format:
The first line of input contains an integer T, denoting the number of test cases.
The first line of each test case contains a string 'S'.
Output Format:
For each test case, print a single line containing “YES” or “NO” depending on whether the string 'S' is the same as its reflection in the mirror or not.
The output of each test case is printed in a separate line.
Note:
You do not need to print anything, it has already been taken care of. Just implement the function.
The return type of the function is boolean, which returns true if the string is the same as its reflection in the mirror, otherwise returns false.
Constraints
1 <= T <=10
1 <= Length(S) <= 10 ^ 5
Where ‘T’ is the number of test cases, ‘S’ is the string given in input.
Time limit: 1sec.
Approaches
For a string to be same as its reflection in the mirror, it should satisfy the following conditions:
- The given string “S” needs to be a palindrome.
- All the characters of the string must be symmetric so that the reflection of the characters remains the same.
- The symmetric characters are AHIMOTUVWXY.
- Store the symmetric characters in an unordered set, traverse the string, and if the string contains any non-symmetric character, then return false.
- If all the characters present in the string are symmetric, then check if the string is a palindrome or not. If the string is a palindrome, then return true, otherwise, return false.