DSA
DSA copied to clipboard
Partition Problem (CPP)
Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same.
EXAMPLE: A[ ]= {1, 5, 11, 5} Output: true (1) The array can be partitioned as {1, 5, 5} and {11}
A[ ] = {1, 5, 3} Output: false (0) The array cannot be partitioned into equal sum sets.
// I wanna contribute this to DP folder , Please assign this to me
Please assign me this issue.
I have made on pr @arnab2001 ..Please merge it
#382