Tap here to switch tabs
Problem
Submissions
Home
Courses
Grokking the Coding Interview Patterns

Problem: Maximum XOR of Subsequences

med
30 min
Try to solve the Maximum XOR of Subsequences problem.

Statement

You are given an integer array nums.

Select two subsequences from nums and calculate the bitwise XOR sum of the elements for each subsequence.

Return the maximum possible bitwise XOR value of the two XOR sums.

Constraints:

  • 2≤2 \leq nums.length ≤105\leq 10^5

  • 0≤0 \leq nums[i] ≤109\leq 10^9

Similar Problems
Encode Number
Number of Steps to Reduce a Number to Zero
Concatenation of Consecutive Binary Numbers
Find XOR Sum of All Pairs Bitwise AND
Minimum Bit Flips to Convert Number
Longest Subsequence With Non-Zero Bitwise XOR
Minimum Numbers of Function Calls to Make Target Array
Largest Combination With Bitwise AND Greater Than Zero
Bitwise XOR of All Pairings
Apply Bitwise Operations to Make Strings Equal
⋮
Tap here to switch tabs
Problem
Submissions
Home
Courses
Grokking the Coding Interview Patterns

Problem: Maximum XOR of Subsequences

med
30 min
Try to solve the Maximum XOR of Subsequences problem.

Statement

You are given an integer array nums.

Select two subsequences from nums and calculate the bitwise XOR sum of the elements for each subsequence.

Return the maximum possible bitwise XOR value of the two XOR sums.

Constraints:

  • 2≤2 \leq nums.length ≤105\leq 10^5

  • 0≤0 \leq nums[i] ≤109\leq 10^9

Similar Problems
Encode Number
Number of Steps to Reduce a Number to Zero
Concatenation of Consecutive Binary Numbers
Find XOR Sum of All Pairs Bitwise AND
Minimum Bit Flips to Convert Number
Longest Subsequence With Non-Zero Bitwise XOR
Minimum Numbers of Function Calls to Make Target Array
Largest Combination With Bitwise AND Greater Than Zero
Bitwise XOR of All Pairings
Apply Bitwise Operations to Make Strings Equal