Kozak Vus and Clever Palindromes#10256
Kozak Vus recently devised an intriguing problem.
You are given strings, each of which is a palindrome with an odd length. For each string, your task is to determine if there exists a palindrome of even length within it.
A palindrome is a sequence that reads the same forwards and backwards. For instance, level and noon are palindromes, whereas abc and noun are not.
A substring of a string is formed by removing zero or more characters from the start and zero or more characters from the end of .
Kozak Vus was particularly fond of this problem and the solution he devised. Can you solve it too?
The first line contains an integer (1 \le t \le 20) — the number of strings.
The next lines each contain a string s_1, s_2, \ldots, s_t (1 \le |s_i| \le 10^5), composed of lowercase Latin letters.
It is guaranteed that each s_i is a palindrome of odd length.
Print lines. On the -th line, print «Yes» if there is a substring of string s_i that is a palindrome of even length; otherwise, print «No».
Example 1
In the second string, the substring «abba» is a palindrome of even length.
In the fourth string, the substring «zyyz» is a palindrome of even length.
If your solution correctly handles the case where t=20 and |s_i|=11, you will earn at least points.