Leetcode heroes

завтрашний дейлик https://leetcode.com/problems/longest-subsequence-with-non-zero-bitwise-xor class Solution: def longestSubsequence(self, a: List[int]) -> int: return any(a)*(len(a)-(reduce(xor,a)==0))