Optimized Solution | Daily Leetcode Challenge ✅
\nclass Solution {\npublic:\n    int minFlips(int a, int b, int c) {\n        int flips = 0; // Counter to track the number of flips required\n        for (int 
```\nclass Solution {\npublic:\n    int minFlips(int a, int b, int c) {\n        int flips = 0; // Counter to track the number of flips required\n        for (int i = 0; i < 32; i++) {\n            // Extract the i-th bit of a, b, and c\n            int bitA = (a >> i) & 1;\n            int bitB = (b >> i) & 1;\n            int bitC = (c >> i) & 1;\n            \n            // Check if the i-th bit of (a OR b) is equal to the i-th bit of c\n            if ((bitA | bitB) != bitC) {\n                if (bitC == 1) {\n                    flips++; // Flip required to make the i-th bit of (a OR b) equal to 1\n                } else {\n                    flips += (bitA == 1) + (bitB == 1); // Flips required to make both bits of a and b equal to 0\n                }\n            }\n        }\n        return flips;\n    }\n};\n```\n\n**PLEASE UPVOTE :)**
['Bit Manipulation', 'C']