Which dynamic programming approach starts solving from the smallest subproblems?

Which dynamic programming approach starts solving from the smallest subproblems?

  1. a) Greedy approach
  2. b) Recursive approach
  3. c) Top-down approach
  4. d) Bottom-up approach

From the Combined Bank Officer (IT) January 2026 – Written (BIBM) exam, question 34 of 115.

More from this paper