Q119
Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
A.
Dynamic programming
B.
Recursion
C.
Brute force
D.
Dynamic programming, Recursion, Brute force
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board