You are given a rooted tree with N vertices (numbered 1 through N); vertex 1 is the root. Each vertex has a weight; let's denote the weight

…

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

8 30
3 99
6 40

solution.cpp

Run code to see test results

00:00 / 69:42

Max XOR Subtree Query - MotorQ Online Assessment

MediumMed•483 views

You are given a rooted tree with N vertices (numbered 1 through N); vertex 1 is the root. Each vertex has a weight; let's denote the weight

…

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

8 30
3 99
6 40

MediumMed•483 views

Asked at

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers