Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2139. Minimum Moves to Reach Target Score
Starting from 1, find the minimum number of moves to reach target using unlimited +1 operations and at most maxDoubles doublings; the core challenge is optimally timing the limited *2 operations to minimize total steps (target up to 1e9, maxDoubles ≤ 100).
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.