1263. 将箱子推到目标位置的最小推动次数
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Medium | Array, Breadth-First Search, Matrix
Medium | Array, Breadth-First Search, Matrix
Medium | Array, Depth-First Search, Breadth-First Search, Matrix
Medium | Array, Breadth-First Search, Graph Theory
Hard | Breadth-First Search, Graph Theory, Shortest Path
Medium | Array, Breadth-First Search
Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sorting
Medium | Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix