1263. 将箱子推到目标位置的最小推动次数
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Heap (Priority Queue), Simulation
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)
Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Hard | Array, Greedy, Heap (Priority Queue), Ordered Set
Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue
Medium | Array, Greedy, Heap (Priority Queue)
Hard | Array, Math, Stack, Heap (Priority Queue), Monotonic Stack
Medium | Array, Greedy, Heap (Priority Queue)
Medium | Array, Sorting, Heap (Priority Queue)
Medium | Array, Heap (Priority Queue)
Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix
Hard | Array, Dynamic Programming, Heap (Priority Queue)
Medium | Array, Greedy, Heap (Priority Queue)
Medium | Array, Binary Search, Greedy, Sorting, Heap (Priority Queue)
Hard | Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue
Easy | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix
Hard | Array, Dynamic Programming, Greedy, Heap (Priority Queue)
Medium | String, Greedy, Heap (Priority Queue)