3593. 最少增量使叶子路径相等
Medium | Array, Dynamic Programming, Tree, Depth-First Search
Medium | Array, Dynamic Programming, Tree, Depth-First Search
Medium | Array, Dynamic Programming, Bit Manipulation, Prefix Sum
Medium | Array, Dynamic Programming, Matrix
Hard | String, Dynamic Programming, Bit Manipulation, Graph Theory, Bitmask
Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path
Hard | Math, Dynamic Programming, Bit Manipulation, Combinatorics
Medium | String, Dynamic Programming, Greedy, Prefix Sum
Medium | Array, Dynamic Programming, Stack, Greedy, Monotonic Stack
Hard | Array, Dynamic Programming
Hard | Array, Dynamic Programming, Matrix