section grouping is a string containing just characters "(" and ")". A standard section succession is a section grouping that can be changed into a right number juggling articulation by embedding characters "1" and "+" between the first characters of the arrangement. For instance, section successions "()()" and "(())" are normal (the subsequent articulations are: "(1)+(1)"
Correct answer will be upvoted else downvoted. Computer science.
section grouping is a string containing just characters "(" and ")". A standard section succession is a section grouping that can be changed into a right number juggling articulation by embedding characters "1" and "+" between the first characters of the arrangement. For instance, section successions "()()" and "(())" are normal (the subsequent articulations are: "(1)+(1)" and "((1+1)+1)"), and ")(", "(" and ")" are not.
You need to find a string b that comprises of n characters to such an extent that:
b is a standard section grouping;
in the event that for some I and j (1≤i,j≤n)
As such, you need to supplant all events of 'A' with a similar kind of section, then, at that point, all events of 'B' with a similar sort of section and all events of 'C' with a similar sort of section.
Your undertaking is to decide whether such a string b exists.
Input
The primary line contains a solitary integer t (1≤t≤1000) — the number of testcases.
Then, at that point, the depictions of t testcases follow.
The main line of each testcase contains a string a. a comprises just of capitalized letters 'A', 'B' and 'C'. Leave n alone the length of a. It is ensured that n is even and 2≤n≤50.
Output
For each testcase print "YES" if there exists such a string b that:
b is an ordinary section arrangement;
on the off chance that for some I and j (1≤i,j≤n) ai=aj, bi=bj.
In any case, print "NO".
Step by step
Solved in 3 steps with 1 images
