Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3315. Construct the Minimum Bitwise Array II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source