Is Minimum Flips to Alternate Binary String (With K Flip Window) associated with Google?

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

FastPrep

Problem Brief

Minimum Flips to Alternate Binary String (With K Flip Window)

NEW GRADOA

See Google online assessment and hiring insights

You are given a binary string s. In one operation, you can flip a subarray of length exactly k (flip all bits in that subarray). Return the minimum number of such operations needed to make the string alternating (i.e., no two adjacent bits are the same). If it's not possible, return -1.

1Example 1

Input

s = "00010111", k = 3

Output

Explanation

^~^

Draft autosaves locally

public int minFlips(String s, int k) {
  // write your code here
}

Input

"00010111"

Output

Company OA Practice

Minimum Flips to Alternate Binary String (With K Flip Window) for Google online assessment prep

FastPrep catalogs Minimum Flips to Alternate Binary String (With K Flip Window) as a Google coding interview and online assessment practice problem. Review the prompt, examples, constraints, and nearby company problems together so the preparation context stays focused on Google OA patterns.

More Google coding assessment problems