Leetcode 3315. Construct the Minimum Bitwise Array II

For each prime p in nums, find the smallest nonnegative integer x such that x OR (x+1) == p (or return -1 if no such x exists); this is a bitwise construction problem that boils down to analyzing the binary pattern of p to determine feasibility and the minimal x.