Problem statementSend feedbackGojo has $2$ weapons RED and BLUE. His attacks are given to you in a string. He can choose any substring which is not empty and if it has equal number of RED and BLUE attacks, he can combine them and perform PURPLE ATTACK.Your task is to determine if it is possible to perform the PURPLE attack.Example:$\text{'}$S$\text{'}="$RRBRBBRR$"$He can choose the substring $"$RBBR$"$ and as there are $2$ RED attacks and $2$BLUE attacks, he can combine and perform the PURPLE attack.Detailed explanation $($Input$/$output format, Notes. Images $)$Constraints :$1$ c$=<=101$c$=$ IS$|<=101\mathrm{.}3,$ where S is the string of attacks.It is guaranteed that the sum of IS over all test cases won't exceed $\text{'}10^5\text{'}.$Time Limit $1$ secondSample Input $1$:RBRRBBRSample Output $1$:YESNOExplanation Of Sample Input $1$:Explanation Of Sample Input $1$:For test case $1$:He can choose the substring $"$RBRRBB$".$ As there are $3$ RED attacks and $3$BLUE attacks, he can combine and perform the PURPLE attack.For test case $2$:There is no substring where the number of RED and BLUE attacks are equal: