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.

For example – [1,2,3,4,5] if we delete 1 then sum(2,5)==sum(3,4) return true;