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
I have been asked this question during a job interview.
I'm obligated to ask this question of Balanced Partition topic in chapter Dynamic Programming of Data Structures & Algorithms II