Minimum Recolors to Get K Consecutive Black Blocks Problem

Minimum Recolors to Get K Consecutive Black Blocks Problem — ExecCode Easy DSA Practice

Solve the Minimum Recolors to Get K Consecutive Black Blocks problem on ExecCode. Free online easy DSA practice in String. Write and run code in Java, C++, Python — no signup required to run.

Description You are given a 0-indexed string blocks of length n, where blocks[i] is either 'W' or 'B', representing the color of the i^th block. The characters 'W' and 'B' denote the colors white and black, respectively. You are also given an integer k, which is the desired numb…

Practice Minimum Recolors to Get K Consecutive Black Blocks free on ExecCode. Browse more ExecCode DSA problems.