C++ || Faster than 100% || With explanatory Comments
Code\n\nclass Solution {\npublic:\n    int minFlips(int a, int b, int c) {\n       int ans=0;\n       while( a || b || c)  //it process untill all digits become
# Code\n```\nclass Solution {\npublic:\n    int minFlips(int a, int b, int c) {\n       int ans=0;\n       while( a || b || c)  //it process untill all digits become zero\n       {\n           //extracting all LSBs of a , b and c\n           //we can extract LSB by performing \'&\' operation to 1\n\n            int x1 = a & 1;\n            int x2 = b & 1;\n            int x3 = c & 1;\n            \n            if( (x1 | x2) != x3)  //if this true then we have to flip the digits according to question\n            {\n               if(x1&x2) ans += 2;   //if both are 1 then we have to flip 2 times\n               else      ans += 1;   //else only 1 times\n            }\n\n            //shift to right by 1 position to perform operation in next digits \n            a = a>>1;       \n            b = b>>1;\n            c = c>>1; \n       } \n       return ans;\n    }\n};\n```\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n    O(log(max(a, b, c)))\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n    O(1)\n
['Bit Manipulation', 'C++']