Given an integer array nums, return the length of the longest strictly increasing subsequence of nums such that the bitwise AND of all elements in the subsequence is strictly greater than $0$.

If no such subsequence exists, return $0$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.