IBMCodingMembers
Minimum Replacements for Adjacent Duplicate Characters
Members only
For each word, find the minimum number of character replacements needed so that no two adjacent characters are equal. Return one replacement count per input word.
SWE
string
greedy
easy
Frequency
Low · New
Last asked
2026-08-27
Stage
oa
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
