How should I practice No Pairs Allowed?

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

Is No Pairs Allowed associated with Palantir?

FastPrep tags this as a Palantir coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · String

No Pairs Allowed

Learn this problem

● EasyPalantirINTERNOA

Problem statement

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

minimalOperations(words: String[]) → int[]

Complete the function minimalOperations in the editor below.

minimalOperations has the following parameter(s):

string words[n]: an array of strings

Returns

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

Examples

Example 1

words = ["add", "boook", "break"]return = [1, 1, 0]

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]

Constraints

1 ≤ n ≤ 100
2 ≤ length of words[x] ≤ 10^5
Each character of words[x] is in the range ascii[a-z]

Problem statement

Function

Examples

Example 1

Constraints

More Palantir problems