Array

1263. 将箱子推到目标位置的最小推动次数

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