1318. Minimum Flips to Make a OR b Equal to c
https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c
Description
Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation).
Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.
Example 1:

Example 2:
Example 3:
Constraints:
1 <= a <= 10^91 <= b <= 10^91 <= c <= 10^9
ac
Previous1317. Convert Integer to the Sum of Two No-Zero IntegersNext1319. Number of Operations to Make Network Connected
Last updated
Was this helpful?