Worst solution ever (Must see)
IntuitionApproachComplexity
Time complexity:O(n2)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:$$O(n^2)$$
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:$$O(1)$$
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int[] minBitwiseArray(List<Integer> lst) {
        int[] ans=new int[lst.size()];
        int add=-1,in=0;;
        for(int n : lst){
            add=-1;
            for(int i=1;i<n;i++){
                if(((i)|(i+1))==n){
                    add=i;
                    break;
                }
            }
            ans[in++]=add;
        }
        return ans;
    }
}
```
['Java']