Description
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.
Example 1:
Input: nums = [1,2,3]
Output: 2
Explanation:
One longest subsequence is [2, 3]. The bitwise XOR is computed as 2 XOR 3 = 1, which is non-zero.
Example 2:
Input: nums = [2,3,4]
Output: 3
Explanation:
The longest subsequence is [2, 3, 4]. The bitwise XOR is computed as 2 XOR 3 XOR 4 = 5, which is non-zero.
Constraints:
1 <= nums.length <= 1050 <= nums[i] <= 109
Solutions
Observation-based exercise.
Language: javascript(2026-08-15 08:24)DONE
CPU Performance37.50%
Memory Performance87.50%
/**
* @param {number[]} nums
* @return {number}
*/
var longestSubsequence = function(nums) {
let xor = 0;
let allZeros = true;
for (const num of nums) {
xor = xor ^ num;
allZeros &&= num === 0;
}
if (allZeros) return 0;
if (xor === 0) return nums.length - 1;
return nums.length;
};