โ† Infosys questions

Max XOR sum of good subsequence

Filed under Infosys

Find the maximum possible XOR sum of a good subsequence. A subsequence is defined as good if for every element at index i, the symmetric element at index n - i + 1 is also present.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Infosys questions

Collected from public candidate posts and coding forums. Updated Nov 2026.