Count Bits

Category: Bit Manipulation

Difficulty: beginner

Description: Brian Kernighan's algorithm

Time Complexity: O(log n)

Space Complexity: O(1)

Related LeetCode Problems

• 338. Counting Bits (Easy)
• 191. Number of 1 Bits (Easy)
• 231. Power of Two (Easy)
• 190. Reverse Bits (Easy)
• 268. Missing Number (Easy)
• 693. Binary Number with Alternating Bits (Easy)
• 476. Number Complement (Easy)
• 1009. Complement of Base 10 Integer (Easy)
• 461. Hamming Distance (Easy)
• 1318. Minimum Flips to Make a OR b Equal to c (Medium)
• 137. Single Number II (Medium)
• 898. Bitwise ORs of Subarrays (Medium)
• 201. Bitwise AND of Numbers Range (Medium)
• 421. Maximum XOR of Two Numbers in an Array (Medium)