📌 C++ || 7 Lines || Faster 96%
Intuition\n- Basically, the problem is broken down to for only even number\n\t- If we have the 01 pattern in binary, then convert it to 00\n\t- Example, 11111 -
**Intuition**\n- Basically, the problem is broken down to for only `even` number\n\t- If we have the `01` pattern in binary, then convert it to `00`\n\t- Example, `11111` -> `01111`, `1010101` -> `1010100`, `10111` -> `10011`\n\n**Code**\n```c++\nvector<int> minBitwiseArray(vector<int>& nums) {\n    vector<int> res;\n    auto solve = [](int& i) {\n        auto str = bitset<64>(i).to_string();\n        for (int i = str.size() - 1; i > 0; i--) \n            if (str[i - 1] == \'0\' && str[i] == \'1\') {\n                str[i] = \'0\';\n                return stoi(str, nullptr, 2);\n            }\n        throw "error";\n    };\n    \n    for (auto num: nums) \n        if (num & 1) res.push_back( solve(num) ); \n        else res.push_back(-1);\n    return res;\n}\n```\n\n**Complexity**\n`Time`: O(n)\n`Space`: O(n)\n\n**For more solutions and concepts, check out this \uD83D\uDCD6 [BLOG](https://github.com/MuhtasimTanmoy/notebook)  and  \uD83C\uDFC6 [GITHUB REPOSITORY](https://github.com/MuhtasimTanmoy/playground) with over 2000+ solutions.**
['C']