> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/bit-manipulation/minimum-flips-to-make-a-or-b-equal-to-c.md).

# Minimum Flips to Make a OR b Equal to c

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:**

![](https://assets.leetcode.com/uploads/2020/01/06/sample_3_1676.png)

```
Input: a = 2, b = 6, c = 5
Output: 3
Explanation: After flips a = 1 , b = 4 , c = 5 such that (a OR b == c)
```

**Example 2:**

```
Input: a = 4, b = 2, c = 7
Output: 1
```

**Example 3:**

```
Input: a = 1, b = 2, c = 3
Output: 0
```

**Constraints:**

* `1 <= a <= 10^9`
* `1 <= b <= 10^9`
* `1 <= c <= 10^9`

```java
class Solution {
    public int minFlips(int a, int b, int c) {
        int compare = a | b;
        int count = 0, index = 0;
        while (compare > 0 || c > 0) {
            int rem1 = compare % 2, rem2 = c % 2;
            if (rem1 == 0 && rem2 == 1)
                count++;
            else if (rem1 == 1 && rem2 == 0)
                count += ((a >> index) & 1) + ((b >> index) & 1);
            compare = compare / 2;
            c = c / 2;
            index++;
        }
        return count;
    }
}
```