SIMPLE SOLUTION || USING BIT MANIPULATION || IN C++ || 100%
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int minChanges(int n, int k) {
        int a=n^k;
        if(a==0){
            return 0;
        }
        if(k>n){
            return -1;
        }
        if((n&k) != k){
            return -1;
        }
        int count=0;
        while(a!=0){
            count++;
            a=a&(a-1);
        }
        return count;
    }
};
```
['C++']