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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 375. Guess Number Higher or Lower II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact