In the context of dynamic programming, what does the term 'overlapping subproblems' refer to?
-
Problems that can be solved independently
-
Problems that can be solved in constant time
-
Problems that can be broken down into smaller subproblems that are reused
-
Problems that require a greedy approach