Available question text
Given a tree where performing an operation on an edge XORs both endpoint node values by k, determine the maximum total node sum achievable by any sequence of operations — equivalently, choose a subset of nodes (subject to the tree's parity constraint from edge operations) to XOR by k so the resulting sum is maximized.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Path Sum with Conditional Node Processing
Coding
- Maximum Sum of Edge Values in a Graph
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3068. Find the Maximum Sum of Node Values
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source