Given a string of black and white blocks, find the minimum number of recolors needed to make some length- segment all black.
You are given a row of blocks represented by a string blocks, where each character is either 'B' for a black block or 'W' for a white block.
In one move, you may recolor a white block into a black block. Your goal is to choose some contiguous segment of length k and make every block in that segment black.
Return the minimum number of recolors required.
For any length- window, the number of recolors needed is exactly the number of white blocks inside that window. You need the smallest such value over all windows.
blocks: a string consisting only of 'B' and 'W'k: the length of the consecutive segment to make all blackReturn the minimum number of 'W' characters contained in any substring of length k.
blocks contains only 'B' and 'W'Example 1
Input
blocks = "WBBWWBBWBW", k = 7
Output
3
Explanation
For the window "BBWWBBW", there are 3 white blocks, and no length-7 window has fewer than 3 whites. Recolor those 3 white blocks to make 7 consecutive black blocks.
Example 2
Input
blocks = "WBWBBBW", k = 2
Output
0
Explanation
The substring "BB" already contains 2 consecutive black blocks, so no recolors are needed.
Premium problem context
Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.