Dynamic Programming21 sections · 916 units
Open in Course

Quiz: Subset Sum Basics

Knowledge check

Check Your Understanding

In the Subset Sum problem, what does dp[i] represent when using 1D space optimization?

  1. A.The minimum elements needed for sum i
  2. B.The maximum element value for sum i
  3. C.The count of subsets with sum i
  4. D.Whether a subset with sum i is achievable
Start the roadmap to answer the quizzes and solve the challenges