3578. 计算最大值最小值差值不超过K的分割数
Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue
Medium | Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue
Hard | Array, Binary Search, Matrix, Prefix Sum, Ordered Set
Medium | Array, Hash Table, Prefix Sum
Medium | Array, Matrix, Prefix Sum
Medium | Array, Hash Table, Prefix Sum
Hard | Array, Dynamic Programming, Matrix, Prefix Sum
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
Hard | Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
Hard | Array, String, Binary Search, Sliding Window, Prefix Sum
Hard | Array, Hash Table, Math, Binary Search, Combinatorics, Counting, Number Theory, Prefix Sum