Home
Log in
DescriptionSubmissionsSolution
DescriptionSubmissionsSolution
Loading...

Log in to run or submit

n =

Codey

Practise coding problems, test your solutions and track your progress.

Explore

  • Problems
  • About
  • Contact

Legal

  • Privacy Policy
  • Terms of Use

© 2026 Codey. Personal learning project.

Solution
Updated: 2026-02-23

Idea

Brian Kernighan’s trick: n & (n-1) clears the lowest set bit.

Approach

Loop while n != 0, clear one bit each iteration and count.

Code
Loading...
Complexity
Time: O(#setBits)
Space: O(1)
Solution
Updated: 2026-02-23

Idea

Brian Kernighan’s trick: n & (n-1) clears the lowest set bit.

Approach

Loop while n != 0, clear one bit each iteration and count.

Code
Loading...
Complexity
Time: O(#setBits)
Space: O(1)