Minimum Operations to Equalize Binary String
Breadth-first search over the number of zeros: each operation flips exactly k positions, so the zero count moves to a new value. The
Breadth-first search over the number of zeros: each operation flips exactly k positions, so the zero count moves to a new value. The