Wissen Technology On-Campus OA 2026 | Coding Assessment | Complete Solutions & Tips | Bit Manipulation & Array Simulation | Mar 4th Campus Assessment

Question 1: K-XOR tree Max. score: 50.00 Problem Statement: Given an undirected tree with N nodes such that there exists a path between any two nodes. For the i^{th} node, a positive integer value A_i is associated with it. You also have a special positive integer K. You may perform the following operation zero or more times on the given tree: Choose an edge and update the value of the nodes associated with that edge with Bitwise XOR of its ...