Available question text
Given a string of 'W'/'B' blocks and an integer k, compute the minimum number of white blocks you must recolor so some contiguous substring of length k is all black — equivalently, slide a length-k window and minimize the count of 'W' inside it.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2379. Minimum Recolors to Get K Consecutive Black Blocks
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source