Tessellate S.T.E.M.S (2019) - Computer Science - School - Set 2 - Objective Problem 1

Count the number of strings which are good with respect to “CMI”. A string A is said to be good with respect to a given string B ( B comprises only of uppercase English letters ) of

• A consists only of uppercase English letters
• Length of A = Length of B
• A is lexicographically larger than B
• On writing both A and B in reverse order, A is still lexicographically larger than B

This problem is a part of Tessellate S.T.E.M.S (2019)