Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 375. Guess Number Higher or Lower II
Find the minimum worst-case total cost to guarantee discovering a secret number in [1..n] when each wrong guess x costs x; this is an interval DP/minimax problem where you choose a pivot guess for each range to minimize the maximum cost of the two resulting subranges.
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.