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, Matrix, Enumeration
Medium | Array, Dynamic Programming, Matrix
Hard | Array, Hash Table, Matrix, Enumeration, Prefix Sum
Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Medium | Array, Greedy, Sorting, Matrix
Medium | Array, Breadth-First Search, Matrix
Medium | Array, Two Pointers, Matrix
Medium | Array, Breadth-First Search, Matrix