3702. Longest Subsequence With Non-Zero Bitwise XOR

You are given an integer array nums.

Return the length of the longest subsequence in nums whose bitwise XOR is non-zero. If no such subsequence exists, return 0.

class Solution {
public:
    int longestSubsequence(vector<int>& nums) {
        int bit = 0, notZero = 0;
        for(auto& n : nums) {
            if(n) {
                notZero++;
                bit ^= n;
            }
        }
        return bit ? nums.size() : notZero ? nums.size() - 1 : 0;
    }
};