Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Bit manipulation

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Bit manipulation

Counting Bits

intermediatelayer I11 · Bit manipulation5 tests

Given a non-negative integer n, return an array ans of length n + 1 where ans[i] is the number of 1 bits in i.

  • The whole array must be produced in O(n) total time
  • Calling a popcount routine per element is O(n log n) and does not count — each entry must be derived in O(1) from an entry you already computed
  • n = 0 is valid and yields [0]

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen