# Counting Bits II

This is an extension to the counting set bits problem, counting the number of set bits or 1's present in a number. In here we see solutions in Java, JavaScript, Cpp, and TypeScript.

In the kth bit set/unset problem, we first write the algorithm, then some pseudocode, and then implement the solution.

This problem is similar to the last lesson we discussed. If you need a clue, return to the previous lesson to further your understanding.

In the kth bit set/unset problem, we need to write a program that checks whether the kth bit of a number is 1 or 0.