BEST SOLUTION EVER!!!
Intuition\n Describe your first thoughts on how to solve this problem. \nBit matipulation is fun with expressions. Less complexity ever.\n# Approach\n Describe 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nBit matipulation is fun with expressions. Less complexity ever.\n# Approach\n<!-- Describe your approach to solving the problem. -->\nIn mind thought the truth table to make expression that results 1 where a flip will happen. \n\n- `__builtin_popcount()` returns number of 1 in binary representation.\n- `(a&b)&~c` -> contains 1\'s when double flip happens\n- `(a|b)^c`  -> contains 1\'s when at least one flip happens.\n\n> Their sum is the answer.\n> If you don\'t understand the expressions, generate truth tables to understand.\n\n# Complexity\n- Time complexity: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minFlips(int a, int b, int c) {\n        return __builtin_popcount((a&b)&~c) + __builtin_popcount((a|b)^c);\n    }\n};\n```
['C++']