How should I practice Get Minimum Operation Count?

Start by reading the full statement, solve the visible examples, then compare the pattern against related IBM online assessment problems in FastPrep.

Is Get Minimum Operation Count associated with IBM?

FastPrep tags this as a IBM online assessment coding practice problem when the problem catalog has that company and stage context.

IBM● MediumNEW GRADOA

A string is beautiful if no two adjacent characters are either

The following operations can be performed on a string, s.

Choose any index i (0 ≤ i < |s|) and change s[i] to any lowercase English letter.

Find the minimum number of operations required to make the string beautiful.

getMinimumOperationCount(s: String) → int

Complete the function getMinimumOperationCount in the editor below.

getMinimumOperationCount has the following parameter:

Returns int: the minimum number of operations required to make s beautiful

s = "abdde"return = 2

String s is not beautiful because:

'dd' violates constraint 1, no two adjacent characters are the same.
'ab' and 'de' violate constraint 2, no two adjacent characters are adjacent in the alphabet.

The string can be converted into a beautiful string after 2 operations. One solution is below:

Note: There are many other solutions such as "ardze", "axdke", etc.

It can be shown that 2 is the minimum number of operations required so return 2.