Kakashi and words
Problem
Kakashi has just finshed a novel and feeling bored. In order to pass time, he has thought of doing something interesting. He'll pick a random word from the novel and check if it is a palindrome or not. He has asked you to confirm if the given word is a palindrome or not.
Input Format--
First line contains t, number of test cases.
Each test case will contains a string s, the given word.
String s will only contain alphabets from 'a' to 'z'.
Output Format--
For each case, output "YES" if given word is a palindrome, else "NO".
Constraints--
1≤t≤100
1≤len(s)≤105
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation
For first case, "hello" is not a palindrome.
For second case, "level" is a palindrome.
