Search
⌘K
Leetcode 3630. Partition Array for Maximum XOR and AND
Partition the array (n ≤ 19) into three disjoint subsequences to maximize XOR(A) + AND(B) + XOR(C); because n is small this is solved by enumerating subset assignments or using bitmask DP/meet‑in‑the‑middle with precomputed subset XOR/AND values.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.