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

DP on bits: popcount(i) = popcount(i>>1) + (i&1).

Approach

Fill array from 1..n using the recurrence.

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

Idea

DP on bits: popcount(i) = popcount(i>>1) + (i&1).

Approach

Fill array from 1..n using the recurrence.

Code
Loading...
Complexity
Time: O(n)
Space: O(n)