Very Easy beats 100%
Intuition\nYou need to turn off the rightmost bit from the left side consecutive ones.\n\n# Approach\nFor a number 111000011111 the solution is always1110000011
# Intuition\nYou need to turn off the rightmost bit from the left side consecutive ones.\n\n# Approach\nFor a number `111000011111` the solution is always`111000001111`.\n\n# Complexity\n- Time complexity:\n$$O(n)$$ --> size of array || Don\'t worry about the solve function the bit length is at max 32.\n\n- Space complexity:\n$$O(n)$$ --> The solution array.\n\n# Code\n```python3 []\nclass Solution:\n    def minBitwiseArray(self, nums: List[int]) -> List[int]:\n        ans = []\n\n        def solve(num):\n            bits = bin(num)[2:]\n            x = 0\n            for i in range(len(bits)-1,-1,-1):\n                if bits[i] == \'1\':\n                    x = i\n                    continue\n                else:\n                    break\n            val = bits[:x]+\'0\'+bits[x+1:]\n            return int(val,2)\n        \n        for num in nums:\n            if num == 2:\n                ans.append(-1)\n            else:\n                ans.append(solve(num))\n        return ans       \n```
['Bit Manipulation', 'Python3']