#3825

Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND

specialist · 865 · lc medium +31 · 50.7% accepted · 98 likes · top 39%

Description

Given an integer array nums, find the length of the longest strictly increasing subsequence whose bitwise AND of all elements is non-zero. Return 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: