Problems Base course RU

Built on

DAG

Articles

DP Technique Dynamic programming Reduce a problem to subproblems, solve each once and keep the answers in a table. states × transitions 2 problems

Problems

Routes with no step back An avalanche of retries

Often together

dynamic programming 1 memoization 1 counting 1 optimization 1 recursion 1 maps and navigation 1 classic 1 interviews 1 contests 1