PreviousNext
Coding/Arrays and strings

Prime bit count range

Write codeEasy15 min

Your task

Given an inclusive integer range [lo, hi] (0 <= lo <= hi <= 1e6), return how many integers v in the range have a prime number of set bits (1s) in their binary representation. For example 6 is 110 (2 set bits, prime) and 7 is 111 (3 set bits, prime). Note 1 set bit is not prime.

Examples

count_prime_set_bits(lo: int, hi: int) -> int
Example 1
Inputcount_prime_set_bits(6, 10)
Output4