Minimum Replacements to Eliminate Adjacent Equal Characters

ibm

Minimum Replacements to Eliminate Adjacent Equal Characters

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

For every ...

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: