[HackerEarth] Given a string S made of letters x, y and z, find the number of sub strings that do not contain all the letters x, y and z. That is the number of sub strings that do not contain at least - 题解