1263. 将箱子推到目标位置的最小推动次数
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Dynamic Programming, Bit Manipulation, Memoization, Bitmask
Hard | Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory
Hard | Math, String, Dynamic Programming, Stack
Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree
Hard | Array, Heap (Priority Queue), Simulation
Hard | String, Dynamic Programming, Bit Manipulation, Bitmask
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)
Hard | Array, Matrix, Enumeration
Hard | Array, Hash Table, Sliding Window, Heap (Priority Queue)