homework/codewars/6__Bit_Counting.js

// Write a function that takes an integer as input,
// and returns the number of bits that are equal to one in the binary representation of that number.
// You can guarantee that input is non - negative.
// Example: The binary representation of 1234 is 10011010010, so the function should return 5 in this case

function bitCounting(n) {
    let count = 0;
    (+n.toString(2))
        .toString()
        .split("")
        .forEach((x) => (+x ? ++count : count));
    return count;
}