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 integerT
, representing the number of test cases.
The subsequentT
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.
AnswerBot
1d
Check if a given string is identical to its mirror reflection.
Iterate through the string and compare characters from start and end simultaneously.
If any characters don't match, return 'NO'.
If all char...read more
Vamsi dheeraj Tula
1y
def solve(s):
ref="AHIMOTUVWXY"
for i in s:
if i not in ref:
return 'NO'
if s==s[::-1]:
return "YES"
return "NO"
Help your peers!
Add answer anonymously...
Top TCS System Engineer interview questions & answers
Popular interview questions of System Engineer
Top HR questions asked in TCS System Engineer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app