There was a weekly challenge question on TECHGIG. Question was something like-"

There is an array of odd size (size<100000). You have to remove any one element from the array, so that array becomes even in size. Now check whether, it is possible to divide the even size array into two equal size set so that total sum of the elements of each set is same. Return 1 if it is possible, otherwise return -1".

How to approach this question? Since size of array was quite large, so, using Dp approach just like “subset sum problem” (having time complexity O(sum*sizeof_array)) seemed to be quite expensive.