No Pairs Allowed

Problem Overview

• Determine, for each word, the minimum substitutions needed so no two adjacent characters are equal.
• Input: array of lowercase strings; Output: array of integers with minimal changes per word; constraints: 1 ≤ n ≤ 100, word length up to 1e5.
• Domain: string processing and validation of adjacent duplicate pairs in text.
• This is an Akuna interviews coding interview problem and a common interview question.