Leetcode 2059. Minimum Operations to Convert Number

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).