2379. 获得 K 个连续黑色块的最少重新涂色次数
Easy | String, Sliding Window
Easy | String, Sliding Window
Medium | Array, Bit Manipulation, Sliding Window
Medium | Array, Binary Search, Bit Manipulation, Sliding Window
Hard | Array, Queue, Sliding Window, Monotonic Queue
Medium | Array, Hash Table, Sliding Window
Medium | Hash Table, String, Sliding Window
Hard | Array, Binary Search, Greedy, Queue, Sliding Window, Prefix Sum
Medium | Array, Hash Table, Sliding Window
Medium | Array, Binary Search, Sliding Window
Medium | Hash Table, String, Sliding Window