how to divide strings

0

Kevin has a string S consisting of N lowercase English letters.

Kevin wants to split it into 4 pairwise different non-empty parts. For example, string "happynewyear" can be splitted into "happy", "new", "ye" and "ar". He can't delete any characters or change the order of the characters.

Help Kevin and find if there exist at least one possible spliting.

Input format:

The first line of input will contain an integer T, denoting the number of test cases. Each of the next T lines contains a string S.

Output format:

For every test case output "YES" if it is possible to split the string and "NO" otherwise.

If the length of the string is less than 10, bruteforce over all possible ways of splitting the string.
Otherwise the answer is $YES$ (split the string into four parts of lengths 1, 2, 3, length - 6).
Refer this if you need help with the bruteforce !