FastPrepFastPrep
Problem Brief

Minimal Operations

FULLTIMEOA
See Salesforce online assessment and hiring insights

For each word in a list of words, if any two adjacent characters are equal, change one of them. Determine the minimum number of substitutions so the final string contains no adjacent equal characters.

Function Description

Complete the function minimalOperations in the editor below.

minimalOperations has the following parameter(s):

  1. string words[n]: an array of strings

Returns

int[n]: each element i is the minimum substitutions for words[i]

: 𓏲🐋 ๋࣭  ࣪Credit to BananaInc˖✩࿐࿔ 🌊

1Example 1

Input
words = ["add", "boook", "break"]
Output
[1, 1, 0]
Explanation
1. 'add': change one d (1 change) 2. 'boook': change the middle o (1 change) 3. 'break': no changes are necessary (0 changes) The return array is [1, 1, 0].

2Example 2

Input
words = ["ab", "aab", "abb", "abab", "abaaaba"]
Output
[0, 1, 1, 0, 1]
Explanation
Unknown for now. Will add once find the reference :)

Constraints

Limits and guarantees your solution can rely on.

  • 1 ≤ n ≤ 100
  • 2 ≤ length of words[i] ≤ 105
  • Each character of words[i] is in the range ascii[a-z]
    • public int[] minimalOperations(String[] words) {
  // write your code here
}
    Input

    words

    ["add", "boook", "break"]

    Output

    [1, 1, 0]

    Sign in to submit your solution.