Problem 330 · Hard
Patching Array
Minimum patches needed to cover range [1, n].
Greedy
Array
Open the interactive visualisation