Problem 69 of 75

Minimum Flips to Make a OR b Equal to c

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

Given three positive integers a, b, and c, return the minimum number of bit flips required in a and b so that (a OR b) equals c.

(2,6,5) → 3 (4,2,7) → 1 (1,2,3) → 0

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Minimum Flips to Make a OR b Equal to c, explainedcodestorywithMIK