find-if-array-can-be-divided-into-two-subsets-of-equal-sum-if-any-one-element-deleted
Given a array of numbers find if there is a way to delete/remove a number from the array and make one partition in the array( dividing the array into two subsets ) such that sum of elements in subset1is equal to sum of elements in subset2.
find-if-array-can-be-divided-into-two-subsets-of-equal-sum-if-any-delete-one-element
Given a array of numbers find if there is a way to delete/remove a number from the array and make one partition in the array( dividing the array into two subsets ) such that sum of elements in subset1is equal to sum of elements in subset2.