3772. 树中子图的最大分数
Hard | Array, Dynamic Programming, Tree, Depth-First Search
Hard | Array, Dynamic Programming, Tree, Depth-First Search
Hard | String, Segment Tree
Hard | Math, Recursion
Hard | Array, Hash Table, Greedy, Counting
Hard | Array, Tree, Depth-First Search
Hard | Dynamic Programming
Hard | Array, Dynamic Programming, Matrix, Prefix Sum
Hard | Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation
Hard | Array, Greedy, Bit Manipulation, Sorting
Hard | Tree, Depth-First Search, Graph Theory, Topological Sort, Sorting
Hard | Hash Table, String, Stack, Greedy, Monotonic Stack
Hard | Math, Bit Manipulation, Combinatorics
Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue
Hard | Array, Dynamic Programming, Enumeration
Hard | Array, Dynamic Programming
Hard | Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queue
Hard | Array, Math, Dynamic Programming, Memoization, Number Theory
Hard | Math, Divide and Conquer, Combinatorics, Number Theory
Hard | Array, Hash Table, Sliding Window, Counting
Hard | String, Divide and Conquer, Prefix Sum