<ul><li>Given a positive integer n, write a function that returns the number of set bits in its binary representation (also known as the Hamming weight).</li><li>One way to count the set bits is by converting the number to a string or array and counting the 1s. However, a more efficient approach is to use bit manipulation.</li><li>By continuously performing the AND operation of n and (n - 1), we can remove the rightmost set bit and count each set bit as we go.</li><li>The time complexity of this approach is O(log n), and the space complexity is O(1).</li></ul>

LeetCode Meditations: Number of 1 Bits

Discover more