# [Solution] Largest Combination With Bitwise AND Greater Than Zero solution leetcode

Largest Combination With Bitwise AND Greater Than Zero solution leetcode – The bitwise AND of an array `nums` is the bitwise AND of all integers in `nums`.

• For example, for `nums = [1, 5, 3]`, the bitwise AND is equal to `1 & 5 & 3 = 1`.
• Also, for `nums = [7]`, the bitwise AND is `7`.

You are given an array of positive integers `candidates`. Evaluate the bitwise AND of every combination of numbers of `candidates`. Each number in `candidates` may only be used once in each combination.

Return the size of the largest combination of `candidates` with a bitwise AND greater than `0`.

• For each violating participant, the first 10 users who submit the violation report towards this participant will each earn 20 LeetCoins.
• Each user can earn up to 100 LeetCoins for reporting violations in a contest.
• Users will not be rewarded LeetCoins for reports on LCCN users.

Example 1:

```Input: candidates = [16,17,71,62,12,24,14]
Output: 4
Explanation: The combination [16,17,62,24] has a bitwise AND of 16 & 17 & 62 & 24 = 16 > 0.
The size of the combination is 4.
It can be shown that no combination with a size greater than 4 has a bitwise AND greater than 0.
Note that more than one combination may have the largest size.
For example, the combination [62,12,24,14] has a bitwise AND of 62 & 12 & 24 & 14 = 8 > 0.
```

## Example 2: Largest Combination With Bitwise AND Greater Than Zero solution leetcode

```Input: candidates = [8,8]
Output: 2
Explanation: The largest combination [8,8] has a bitwise AND of 8 & 8 = 8 > 0.
The size of the combination is 2, so we return 2.
```

Constraints:

• `1 <= candidates.length <= 105`
• `1 <= candidates[i] <= 107`