Error
|
|
---|---|
@Ibrahim Nash | 6420 |
@blackshadows | 6376 |
@mb1973 | 5604 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@kirtidee18 | 3673 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3413 |
Complete Leaderboard | |
|
|
@codersgroup18 | 799 |
@sriramgoparaju99 | 737 |
@Manikanta punnam | 629 |
@rdakka | 606 |
@prankursharma31 | 597 |
@praveenbgp6 | 546 |
@sanskar94511 | 531 |
@purohitmn02 | 525 |
@yashkaril4 | 517 |
@abhikarshgupta | 474 |
@rohitgarg2825 | 464 |
Complete Leaderboard |
Given an array arr[] of N positive integers. Find an integer denoting the maximum XOR subset value in the given array arr[].
Example 1:
Input : N = 3 arr[] = {2, 4, 5} Output : 7 Explanation : The subset {2, 5} has maximum subset XOR value.
Example 2 :
Input : N= 3 arr[] = {9, 8, 5} Output : 13 Explanation : The subset {8, 5} has maximum subset XOR value.
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes