package leetcode;

/**
 * https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/
 */
public class Problem762 {
    public int countPrimeSetBits(int L, int R) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem762 prob = new Problem762();
        System.out.println(prob.countPrimeSetBits(6, 10)); // 4
        System.out.println(prob.countPrimeSetBits(10, 15)); // 5
    }
}

@@ -195,16 +195,17 @@
 // TODO%0A
+%0A
         
@@ -221,16 +221,176 @@
 %0A    %7D%0A%0A
+    private static boolean isPrime(int n) %7B%0A        return n == 2 %7C%7C n == 3 %7C%7C n == 5 %7C%7C n == 7 %7C%7C n == 11 %7C%7C%0A            n == 13 %7C%7C n == 17 %7C%7C n == 19;%0A    %7D%0A%0A
     publ

Update problem 762