100% efficient and easy
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![image.png](https://assets.leetcode.com/users/images/2f143d2e-24a3-4c0d-9555-50244613c404_1705170871.4472792.png)\n```\nclass Solution:\n    def bitwiseComplement(self, n: int) -> int:\n        bits = list(bin(n))[2:]\n        for i, value in enumerate(bits):\n            bits[i] = "1" if value == "0" else "0"\n        \n        return int("".join(bits), 2)\n```
['Python3']