https://h30306.github.io/blog/tags/memoization/Recent content in Memoization onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/algorithm/interval-dp/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/interval-dp/Interval DP (choose the last step / merge equal ends), partition DP into k segments, palindrome tables plus partitioning, and memoizing the whole state when it is too tangled to splithttps://h30306.github.io/blog/leetcode/leetcode-773/Mon, 07 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-773/LeetCode 773 note: there are only 6! = 720 boards, so flatten each board into a string as a BFS state, with swaps of 0 and a neighbor as the moveshttps://h30306.github.io/blog/leetcode/leetcode-2328/Sun, 30 Aug 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2328/LeetCode 2328 note: strictly increasing means no cycles; dp[cell] = 1 + Σ dp[larger neighbors], processed from largest to smallest value (or by memoized DFS), summed over all cellshttps://h30306.github.io/blog/leetcode/leetcode-488/Wed, 08 Jul 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-488/LeetCode 488 note: with at most 16 balls on the board and 5 in hand, memoize DFS on the whole (board, hand) state, inserting only before a same-colored ball or between two equal ballshttps://h30306.github.io/blog/leetcode/leetcode-397/Wed, 16 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-397/LeetCode 397 note: even numbers are always halved; for odd numbers try +1 and -1 with memoized recursion, since n is too large for an n-sized arrayhttps://h30306.github.io/blog/leetcode/leetcode-1137/Tue, 18 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1137/LeetCode 1137 note: like Fibonacci, roll three variables; watch the base values T0 = 0, T1 = T2 = 1 and the loop rangehttps://h30306.github.io/blog/leetcode/leetcode-509/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-509/LeetCode 509 note: the starting point of 1D DP; only the previous two terms are needed, so roll two variables