3702. Longest Subsequence With Non-Zero Bitwise XOR

class Solution {
    public int longestSubsequence(int[] nums) {
        int totalXor = 0;
        boolean hasNonZero = false;

        for (int num : nums) {
            totalXor ^= num;
            if (num != 0) {
                hasNonZero = true;
            }
        }

        int n = nums.length;

        if (totalXor != 0) {
            return n;
        }

        return hasNonZero ? n - 1 : 0;
    }
}

class Solution:
    def longestSubsequence(self, nums):
        totalXor = 0
        hasNonZero = False

        for num in nums:
            totalXor ^= num

            if num != 0:
                hasNonZero = True

        n = len(nums)

        if totalXor != 0:
            return n

        return n - 1 if hasNonZero else 0

class Solution {
public:
    int longestSubsequence(vector<int>& nums) {
        int totalXor = 0;
        bool hasNonZero = false;

        for (int num : nums) {
            totalXor ^= num;

            if (num != 0) {
                hasNonZero = true;
            }
        }

        int n = nums.size();

        if (totalXor != 0) {
            return n;
        }

        return hasNonZero ? n - 1 : 0;
    }
};

/**
 * @param {number[]} nums
 * @return {number}
 */
var longestSubsequence = function(nums) {
    let totalXor = 0;
    let hasNonZero = false;

    for (const num of nums) {
        totalXor ^= num;

        if (num !== 0) {
            hasNonZero = true;
        }
    }

    const n = nums.length;

    if (totalXor !== 0) {
        return n;
    }

    return hasNonZero ? n - 1 : 0;
};