Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.