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

Minimum Flips to Make a OR b Equal to c

intermediatelayer I11 · Bit manipulation5 tests

Given three non-negative integers a, b and c, return the minimum number of single-bit flips (in a and/or b) needed so that (a | b) === c.

  • A flip changes one bit of a or one bit of b from 0 to 1 or from 1 to 0; c is never modified
  • All three fit in a signed 32-bit integer, so 32 bit positions are enough
  • If (a | b) already equals c the answer is 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