Memoization
β’ 31 words β’ 1 min
β’ updated
How to bootstrap a top-down dynamic programming (DP) problem in Python:
from functools import cache
class Solution:
def doProblem(self, input: List[int]) -> int:
@cache
def solve():
pass
return solve(0)
Previously.
Related Posts
In a typical dynamic programming (DP) problem, you’ll usually instantiate a variable to hold previously computed data (cache).
For example, β¦
Jan 12, 2024
When LeetCoding or participating in programming contests, it’s worth to highlight a few differences between C++ and Python:
cpp - maximum β¦
Jun 22, 2026
Previously, previously, previously, previously, previously.
