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, Math, Dynamic Programming, Sorting
Medium | Array, Binary Indexed Tree, Segment Tree, Sorting
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Medium | Array, Depth-First Search, Matrix
Medium | Array, Divide and Conquer, Tree, Matrix
Medium | Array, Hash Table, Math
Easy | Array, Depth-First Search, Breadth-First Search, Matrix
Hard | Array, String, Dynamic Programming, Depth-First Search, Trie, Sorting