💯Faster✅💯Less Mem✅🧠Detailed Approach🎯Bitwise Operation🔥C++😎
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minChanges(int n, int k) {\n        bitset<32> a(n);\n        bitset<32> b(k);\n\n        int c = 0;\n\n        for (int i = 0; i < 32; i++) {\n            if (a[i] != b[i]) {\n                c++;\n                a[i] = 0;\n            }\n        }\n\n        if(a == b){\n            return c;\n        }\n        return -1;\n    }\n};\n\n```
['C++']