Minimum Replacements to Avoid Equal Adjacent Characters

Problem: Minimum Replacements to Avoid Equal Adjacent Characters

You are given an array of strings words. For each word, you may replace any character with any lowercase English letter.

Return ...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: