You have a boutique that specializes in words that don't have adjacent matching characters.
Bobby, a competitor, has decided to get out of the word business altogether and you have bought his inventory.
Your idea is to modify his inventory of words so they are suitable for sale in your store.
To do this, you find all adjacent pairs of matching characters and replace one of the characters with a different one.
Determine the minimum number of characters that must be replaced to make a salable word.
For example, you purchased words = [add, boook, break].  You will create an array with your results from the tests.
Change the 2nd d in add. change  the middle o in boook and no change is necessary in break.
The return array result = [1, 1, 0].


const test = [`ab`, `abij`, `abbb`, `aabb`, `abaaabb`]
const correct = [0, 0, 1, 2, 2];
const noPairsAllowed = (words) => {
    const newArray = [];
    for (let i = 0; i < words.length; i++) {
        const word = words[i];
        let count = 0;
        for (let j = 0; j < word.length; j++) {
            if (word[j] === word[j + 1]) {count += 1;}
            j+2;
        }
        newArray.push(count);
        count = 0;

    }
    return newArray;
}

console.log(`Correct Answer:`, correct)
console.log(`Solution:`, noPairsAllowed(test))