✅✅BEST AND SIMPLE SOLUTION🤩🤩
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        \n        int cnt = 0;\n        \n        for(int i=0; i<30; i++) {\n            if(k & (1<<i)) {\n                if(!(n&(1<<i))) {\n                    return -1;\n                }\n            }\n            else {\n                if(n&(1<<i)) cnt++;\n            }\n        }\n        \n        return cnt;\n    }\n};\n```
['C++']