Simple C sol, Beats 100% :)
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```c []\n/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* minBitwiseArray(int* nums, int numsSize, int* returnSize) {\n\nint *jvrc = (int *)malloc(numsSize * sizeof(int ));\n\nfor(int i = 0 ; i < numsSize ; i++)\n{\n    int count = 0 ,tom = 0 , c = 0, z = 0 ;\n\n    while(c < 1500)\n    {\n        int a = z|(z+1);\n       if(a == nums[i])\n       {\n            printf("hi");\n            jvrc[i] = z ;\n            tom++;\n            break;\n       }\n       c++;\n       z++;\n    }\n    if(tom == 0)\n    {\n        jvrc[i] = -1;\n    }\n\n}\n\n*returnSize = numsSize; \nreturn jvrc; \n}\n```
['C']