Which of the following is not a characteristic of problems suited for Dynamic programming (SP means subproblems)?

Which of the following is not a characteristic of problems suited for Dynamic programming (SP means subproblems)?

  1. a) Overlapping SP
  2. b) Optimal substructure
  3. c) Independent SP
  4. d) Repeated computation of SP

From the BCS Technical Cadre (CSE) October 2025 – 49th BCS Written (Special) (BPSC) exam, question 14 of 123.

More from this paper