Don't you know how to play rock-paper-scissors? Just read this. You'll find solution easily if you read it till the end.

This problem can be solved greedily. Just make a list of strings for which answer is "NO". In order to do this add all strings in the sample testcases and add some strings that you don't like.
Easier solution for this problem uses suffix array + DP.

Failed to load. Check your internet connection.

You just need poor english skills to understand problem statement. Solving part is easy.

Also in this problem first you need to understand problem statement(look at the circles carefully).And then you need 4D segment tree to find solution.

In this problem you need check all bitmasks of size n. Since n is large you can divide it into 5 parts and do meet in the middle.

Tutorial is not coming soon.