Available question text
Given start and a set of numbers, find the minimum number of +, -, or bitwise-XOR operations (using any nums[i] repeatedly) to reach goal; because new operations are only permitted while x is in [0,1000] (moves that land outside are allowed but terminate further moves), this reduces to a shortest-path/BFS on the bounded state graph (return steps or -1).
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 2059. Minimum Operations to Convert Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source