✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1.1 - One Line\nTime complexity: O(1). S
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1.1 - One Line\nTime complexity: $$O(1)$$. Space complexity: $$O(1)$$.\n```\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        return max(-1,sum(v!=u and (1,-inf)[v==\'0\'] for v,u in zip_longest(bin(n)[:1:-1],bin(k)[:1:-1],fillvalue=\'0\')))\n```\n\n# Code #1.2 - Unwrapped\n```\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        res = 0\n        for v,u in zip_longest(bin(n)[:1:-1], bin(k)[:1:-1], fillvalue=\'0\'):\n            if v != u:\n                if v == \'0\':\n                    return -1\n                \n                res += 1\n        \n        return res\n```\n\n(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be \'true\' oneliners - please, remind about drawbacks only if you know how to make it better)
['Bit Manipulation', 'Python', 'Python3']