Dynamic Programming21 sections · 916 units
Open in CourseQuiz: Target Sum Transform
Testing the reduction
Check Your Understanding
In the Target Sum problem with + and - operations, how do we transform it to a subset sum problem?
- A.Sort the array first
- B.We cannot transform it
- C.Find subset P where sum(P) = (target + total) / 2
- D.Find subset with sum = target