Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Guess Number Higher or Lower
Coding
- Given an API for lower-level hard disk management, implement APIs for storing, retrieving, and error-correcting data in a higher-level storage device composed of three of the lower-level disks.
Coding
- Guess the Number Using Bitwise Questions I
Coding
- Guess the Number Using Bitwise Questions II
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 375. Guess Number Higher or Lower II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source