All Tracks Algorithms String Algorithms Basics of String Manipulation Problem

Pallindrome
/
No tags
Problem
Editorial
Analytics

You are given a string S.You need to check whether it's a palindrome or not. Print "YES" (without quotes) if S is a palindrome and "NO" (without quotes) if S is not a palindrome.

To know what a palindrome is you can check http://bit.ly/HashesPallindrome

INPUT First line will contain an integer T that is the number of test cases. The following T lines will contain: -A string S consisting of only lowercase letters.

OUTPUT Output YES or NO in new line for each test case.

SAMPLE INPUT
1
aba
SAMPLE OUTPUT
YES
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

Initializing Code Editor...
Notifications
View All Notifications

?