Easy C++ Solution (UPVOTE)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(32) ~O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(128) ~ O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n\n    void decToBinary(int n,int binaryNum[])\n{\n    int i = 0;\n    while (n > 0) {\n        binaryNum[i] = n % 2;\n        n = n / 2;\n        i++;\n    }\n}\n\n    int minFlips(int a, int b, int c) {\n        int x[32]={0};\n        int y[32]={0};\n        int z[32]={0};\n        decToBinary(a,x);\n        decToBinary(b,y);\n        decToBinary(c,z);\n\n        int i,j,k,s=0,m=0;\n        for(i=0;i<32;i++){\n            int a_or_b=x[i]|y[i];\n            if(a_or_b !=z[i]){\n                if(a_or_b==1 and z[i]==0){\n                    if(x[i]==1 and y[i]==1)\n                    s+=2;\n                    else\n                    s++;\n                }\n                else{\n                    s++;\n                }\n            }\n        }\n\n\n        return s;\n        \n    }\n};\n```
['Bit Manipulation', 'C++']