🟢🔴🟢 Beats 100.00%👏 Easiest Solution 🟢🔴🟢
\nclass Solution {\n  List<int> minBitwiseArray(List<int> nums) {\n\n    List<int> ans = [];\n    for(int i = 0; i < nums.length; i++){\n      int prime = -1;  
```\nclass Solution {\n  List<int> minBitwiseArray(List<int> nums) {\n\n    List<int> ans = [];\n    for(int i = 0; i < nums.length; i++){\n      int prime = -1;  \n      for(int j = 1; j < nums[i]; j++){\n        if(j | (j + 1) == nums[i]){\n            prime = j;\n            break;\n        }\n      }\n      ans.add(prime);\n    }\n    return ans;\n    \n  }\n}\n```
['C', 'Python', 'C++', 'Java', 'JavaScript', 'C#', 'Dart']