O(1) SOLUTION BY ELDEN LORD
Intuition\n Describe your first thoughts on how to solve this problem. \nWE CHECK FOR EVERY BIT WHETHER WE CAN MAKE EQUAL OR NOT\nONE CASE WHEN WE CANT IS WHEN 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nWE CHECK FOR EVERY BIT WHETHER WE CAN MAKE EQUAL OR NOT\nONE CASE WHEN WE CANT IS WHEN K==1 and n is not \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:\n    def minChanges(self, n: int, k: int) -> int:\n        ans=0\n        \n        for x in range(32):\n    \n            if n & 1 << x == 1<<x and k & 1<<x ==0:\n                ans+=1\n            elif n & 1 << x == 0 and k & 1<<x == 1<<x:\n                return -1\n        return ans \n        \n```
['Python3']