Let S be the set of all ternary strings defined over the alphabet \a, b, c\. Consider all strings in S that contain at least one occurrence of two consecutive symbols, that is, “aa”, “bb” or “cc”. The number of such strings of length 5 that are possible is … (Answer in integer)
Topic-wise GATE CS PYQs with verified steps
