You have a word of length L made up only of lowercase English letters. A character at position i is called a conflict if it equals the character immediately before it (i.e., word[i] == word[i-1]).

In each repair step, you may replace any one character with any different lowercase letter. Find the minimum number of repair steps needed to produce a word with zero conflicts. ...