Skip to content

Practice Kth Smallest Path XOR Sum

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3590
LeetCode Problem

Kth Smallest Path XOR Sum

Problem Statement

You are given an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1. Each node i has an integer value vals[i], and its parent is given by par[i]. The path XOR sum from the root to a node u is defined as the bitwise XOR of all vals[i] for nodes i on the path from the root node to node u, inclusive. You are given a 2D integer array queries, where queries[j] = [uj, kj]. For each query, find the kjth smallest distinct path XOR sum among all nodes in the subtree rooted at uj. If there are fewer than kj distinct path XOR sums in that subtree, the answer is -1. Return an integer array where the jth element is the answer to the jth query. In a rooted tree, the subtree of a node v includes v and all nodes whose path to the root passes through v, that is, v and its descendants.

Source: Kth Smallest Path XOR Sum on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
par = [-1,0,0], vals = [1,1,1], queries = [[0,1],[0,2],[0,3]]
Output
[0,1,-1]

# Example 2

Input
par = [-1,0,1], vals = [5,2,7], queries = [[0,1],[1,2],[1,3],[2,1]]
Output
[0,7,-1,0]

Constraints

1 <= n == vals.length <= 5 * 10^4
0 <= vals[i] <= 10^5
par.length == n
par[0] == -1
0 <= par[i] < n for i in [1, n - 1]
1 <= queries.length <= 5 * 10^4
queries[j] == [uj, kj]
0 <= uj < n
1 <= kj <= n
The input is generated such that the parent array par represents a valid tree.

Related LeetCode Problems

Practice more problems similar to Kth Smallest Path XOR Sum.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.