General Tree Others¶
Table of Contents¶
- 2003. Smallest Missing Genetic Value in Each Subtree (Hard)
- 2867. Count Valid Paths in a Tree (Hard)
- 2421. Number of Good Paths (Hard)
- 1719. Number Of Ways To Reconstruct A Tree (Hard)
- 2479. Maximum XOR of Two Non-Overlapping Subtrees (Hard) 👑
2003. Smallest Missing Genetic Value in Each Subtree¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, tree, depth first search, union find
2867. Count Valid Paths in a Tree¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: math, dynamic programming, tree, depth first search, number theory
2421. Number of Good Paths¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, hash table, tree, union find, graph, sorting
1719. Number Of Ways To Reconstruct A Tree¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: tree, graph
2479. Maximum XOR of Two Non-Overlapping Subtrees¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: tree, depth first search, graph, trie