675. 砍树
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix
Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix
Medium | Array, Binary Search, Sorting, Heap (Priority Queue), Matrix
Medium | Array, Depth-First Search, Breadth-First Search, Matrix
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
Hard | Array, Dynamic Programming, Matrix
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
Hard | Array, String, Backtracking, Trie, Matrix
Medium | Array, Binary Search, Divide and Conquer, Matrix
Medium | Array, Design, Matrix, Prefix Sum