> For the complete documentation index, see [llms.txt](https://851958789.gitbook.io/notes/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://851958789.gitbook.io/notes/0375_guess_number_higher_or_lower_ii/slt.md).

# 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