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.