100% beats || MOST OPTIMIZED || C++
if(c&1 == 1) than \n    :- check (a&)&&(b&1)==0 tha there is need for change c&1\nelse c&1 == 0 than\n    :- increment ans By a&1 + b&1\ndivide a,b,c by 2 until
if(c&1 == 1) than \n    :- check (a&)&&(b&1)==0 tha there is need for change c&1\nelse c&1 == 0 than\n    :- increment ans By a&1 + b&1\ndivide a,b,c by 2 untill all are not 0.\n\n# Complexity\n- Time complexity:\nO(32)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution\n{\npublic:\n    int minFlips(int a, int b, int c)\n    {\n        int d = 0;\n        while (a || b || c)\n        {\n            if (c & 1)\n            {\n                if ((a & 1) == 0 && (b & 1) == 0)\n                {\n                    d++;\n                }\n            }\n            else\n            {\n                if (a & 1)\n                    d++;\n                if (b & 1)\n                    d++;\n            }\n        a >>= 1, b >>= 1, c >>= 1;\n        }\n    return d;\n    }\n};\n```
['Bit Manipulation', 'Bitmask', 'C++']