1263. 将箱子推到目标位置的最小推动次数
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory
Hard | Array, Heap (Priority Queue), Simulation
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)
Hard | Array, Matrix, Enumeration
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)
Hard | Array, Binary Search, Greedy
Hard | Array, Binary Search, Dynamic Programming, Sorting
Medium | Array, Dynamic Programming, Matrix
Medium | Array, Greedy, Enumeration
Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree
Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum
Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
Hard | Array, String, Divide and Conquer, Tree, Segment Tree
Hard | Array, Hash Table, String, Design, Trie
Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Hard | Array, Greedy, Heap (Priority Queue), Ordered Set
Easy | Array, Hash Table, String, Bit Manipulation, Counting
Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue
Medium | Array, Greedy, Heap (Priority Queue)