# [2220\. Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)

:::spoiler Hint

:::

:::spoiler Solution

class Solution {
public:
    int minBitFlips(int start, int goal)
    {
        int n = start ^ goal;
        int cnt = 0;
        while (n)
        {
            n &= (n - 1);
            cnt++;
        }
        return cnt;
    }
};

- T: $O(number of bits)$
- S: $O(1)$
:::