Maximum weight independent set
You are given an undirected tree with n nodes labeled 0..n-1, its n-1 edges, and a value for each node in 'values'. Choose a subset of nodes with maximum total value such that no two chosen nodes are adjacent (a maximum-weight independent set on a tree). Values may be any non-negative integers. Return the maximum total value. 1 <= n <= 10^5.
Implement
tree_max_independent_set(n: int, edges: list[list[int]], values: list[int]) → intExamples
in
[5,[[0,1],[0,2],[1,3],[1,4]],[3,2,1,10,1]]out14What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[5,[[0,1],[0,2],[1,3],[1,4]],[3,2,1,10,1]]14not run yetsample