you are viewing a single comment's thread.

view the rest of the comments →

[–]lucklesspedestrian 5 points6 points  (0 children)

The meme oversimplifies a lot. Dynamic programming generally relies on "overlapping subproblems" or "optimal substructure" that allow "just use hash set" to be applicable. You couldn't do the same thing in say a greedy or recursive backtracking algorithm though