#3702

Longest Subsequence With Non-Zero Bitwise XOR

expert · 1055 · lc medium +32 · 37.2% accepted · 94 likes · top 15%

Description

Given an integer array nums, return the length of the longest subsequence whose bitwise XOR is non-zero, or 0 if no such subsequence exists.

Code

1

2

3

class Solution:
    def longestSubsequence(self, nums: List[int]) -> int:

class Solution:
    def longestSubsequence(self, nums: List[int]) -> int: