3825. Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND

You are given an integer array nums. Return the length of the longest strictly increasing subsequence in nums whose bitwise AND is non-zero. If no such subsequence exists, return 0. Example 1: Input: nums = [5,4,7] Output: 2 Explanation: One longest strictly increasing subsequence is [5, 7]. The bitwise AND is 5 AND 7 = 5, which is non-zero. Example 2: Input: nums = [2,3,6] Output: 3 E