One DSA question was asked in the interview, which was supposed to be solved in one hour. There were two rounds in all. I was able to solve all questions and clear all rounds.

You are given an integer array nums.

Partition the array into three (possibly empty) subsequences A, B, and C such that every element of nums belongs to exactly one subsequence.

Your goal is to maximize the value of: XOR(A) + AND(B) + XOR(C)

where:

• XOR(arr) denotes the bitwise XOR of all elements in arr. If arr is empty, its value is defined as 0.
• AND(arr) denotes the bitwise AND of all elements in arr. If arr is empty, its value is defined as 0.

Return the maximum value achievable.

Note: If multiple partitions result in the same maximum sum, you can consider any one of them.