Problem Brief

No Pairs Allowed

INTERNOA

For each word in a list of words, if any two adjacent characters are equal, change one of them. Determine the minimum number of substitutions so the final string contains no adjacent equal characters.

Function Description

Complete the function minimalOperations in the editor below.

minimalOperations has the following parameter(s):

string words[n]: an array of strings

Returns

int[n]: each element is the minimum substitutions for words[x]

1Example 1

Input

words = ["add", "boook", "break"]

Output

[1, 1, 0]

Explanation

1. add: change one d (1 change) 2. boook: change the middle o (1 change) 3. break: no changes are necessary (0 changes) The return array is [1, 1, 0]

Constraints

Limits and guarantees your solution can rely on.

1 ≤ n ≤ 100
2 ≤ length of words[x] ≤ 10^5
Each character of words[x] is in the range ascii[a-z]