Solution 1 DP
t-complexity: $O(N^3)$
s-complexity: $O(N^2)$
problem explained: https://leetcode.com/problems/guess-number-higher-or-lower-ii/discuss/84766/Clarification-on-the-problem-description.-Problem-description-need-to-be-updated-!!!
dp[i][j]
denotes guess number from [i, j], min cost of win game
Last updated