Dynamic Programming (memoization)

Use when you have overlapping subproblems that can be cached to avoid redundant work.

→ “Min / max / count number of ways”

→ “Best / optimal”

→ “How many ways …”

→ “Can you reach / can you form …”

→ “Subproblem / overlapping subproblems”

→ “Choose / take or skip”

→ “Partition / split”

→ “Longest / shortest” (often DP)

→ “Sequence / array with decisions at each index”