Counting Strategies: Casework, Complementary & Overcounting · Hard problem

How many four-letter strings over the $26$-letter alphabet have no two adjacent letters equal?