Category:Backtracking (DP)

From Algorithmist
Jump to navigation Jump to search

A modified version of dynamic programming where, at the end, you work backwards to produce a solution. For example, instead of "find the least number of coins needed to make change" you would actually have to output the list of coins.

Variants on this technique include producing the lexicographically-first solution when multiple solutions exist.

Pages in category "Backtracking (DP)"

This category contains only the following page.