Longest Subsequence With Maximum Bitwise AND
You are given an integer array nums of size n.
Consider a non-empty subsequence from nums that has the maximum possible bitwise AND.
In other words, let k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should be considered.
Return the length of the longest such subsequence.
The bitwise AND of an array is the bitwise AND of all the numbers in it.
A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements (source: wiki)
Input: nums = [1,2,3,3,2,2]
The maximum possible bitwise AND of a subarray is 3.
The longest subarray with that value is [3,3], so we return 2.
Input: nums = [1,2,3,4]
The maximum possible bitwise AND of a subarray is 4.
The longest subarray with that value is , so we return 1.
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6
A possible follow up for Leetcode 2419. Longest Subarray With Maximum Bitwise AND