Skip to content

2275. Largest Combination With Bitwise AND Greater Than Zero 👍

  • Time: $O(24n) = O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
class Solution {
 public:
  int largestCombination(vector<int>& candidates) {
    constexpr int kMaxBit = 24;
    int ans = 0;

    for (int i = 0; i < kMaxBit; ++i) {
      int count = 0;
      for (const int candidate : candidates)
        if (candidate >> i & 1)
          ++count;
      ans = max(ans, count);
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
class Solution {
  public int largestCombination(int[] candidates) {
    final int MAX_BIT = 24;
    int ans = 0;

    for (int i = 0; i < MAX_BIT; ++i) {
      int count = 0;
      for (final int candidate : candidates)
        if ((candidate >> i & 1) == 1)
          ++count;
      ans = Math.max(ans, count);
    }

    return ans;
  }
}

1
2
3
class Solution:
  def largestCombination(self, candidates: list[int]) -> int:
    return max(sum(c >> i & 1 for c in candidates) for i in range(24))