#C9461. Palindrome Checker

    ID: 53557 Type: Default 1000ms 256MiB

Palindrome Checker

Palindrome Checker

In this problem, you are given T strings. For each string, your task is to check whether it is a palindrome or not. A palindrome is a string that reads the same forwards and backwards when case is ignored. For example, the string $$\texttt{RaceCar}$$, when converted to lowercase, becomes $$\texttt{racecar}$$ which reads the same from left to right and right to left. An empty string is considered a palindrome. Your program should be efficient and handle multiple test cases as described in the input format.

inputFormat

The first line of input contains an integer T, the number of test cases. Each of the following T lines contains a single string S which needs to be checked.

outputFormat

For each test case, output a single line containing 'YES' if the string is a palindrome or 'NO' if it is not.## sample

3
racecar
hello
level
YES

NO YES

</p>