leetcode.com 2026-08-15
🟡3702.longest-subsequence-with-non-zero-bitwise-xor
🏷️ Tags
#bit_manipulation #array
Telegraph
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. Example 1: Input: nums = [1,2,3] Output: 2 Explanation: One longest subsequence is [2, 3].…
August 15, 2026 69
