Finding the subproblem

The hard part of dynamic programming is finding the subproblem, not the memoisation.

• Software engineering

1 idea that carry it

• TechniqueSoftware engineeringVideo located

  In dynamic programming the hard part is finding the subproblem, not the memoisation

  Find the subproblem and the recurrence first; the implementation is mechanical once the structure is clear.

  Coding interviews, and any problem whose difficulty is in the decomposition.

  From 5 Simple Steps for Solving Dynamic Programming Problems · Reducible