Given two integers L and R, write a program that finds the count of numbers having prime number of set bits in their binary representation in the range [L, R].
Input: L = 6, R = 10 Output: 4 Explanation: 6, 7, 9, 10 having prime set bits between 6 and 10.
Input: L = 10, R = 15 Output: 5 Explanation: 10, 11, 12, 13, 14 having prime set bits between 10 and 15.
You dont need to read input or print anything. Complete the function primeSetBits() which takes L and R as input parameter and returns the count of numbers having prime number of set bits in their binary representation.
Expected Time Complexity: O(nlog(n)sqrt(n))
Expected Auxiliary Space: O(1)
1 <= L <= R <=1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes