2003. 每个子树内缺失的最小遗传值
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find
Medium | Array, Hash Table, Binary Search, Dynamic Programming, Sorting
Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask
Hard | Array, Dynamic Programming, Graph Theory, Topological Sort
Medium | Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)
Hard | String, Dynamic Programming
Medium | Math, String, Dynamic Programming, Combinatorics
Medium | String, Dynamic Programming, Greedy
Medium | Array, Dynamic Programming, Prefix Sum
Medium | Array, Math, Two Pointers, Dynamic Programming, Sliding Window