Largest Combination With Bitwise AND Greater

lcpy gen -n 2275   # by problem number
lcpy gen -s largest_combination_with_bitwise_and_greater_than_zero   # by problem name

Input: candidates = [16,17,71,62,12,24,14]
Output: 4

Input: candidates = [8,8]
Output: 2

class Solution:
    # Time: O(n * b) where b is the bit width of the largest value (<= 24)
    # Space: O(1)
    def largest_combination(self, candidates: list[int]) -> int:
        best = 0
        for bit in range(24):
            count = 0
            for value in candidates:
                count += (value >> bit) & 1
            best = max(best, count)
        return best