There are n numbers and we have to split the numbers into 2 sets such that difference of the sum of numbers of both sets is less than 100. Is this problem NP complete?
Solution: I can prove that it belongs to NP but I am not able to find a reduction from another NP complete problem to this problem. I have tried reducing Subset Partition problem to this problem but no luck.
Please suggest any alternate solutions or how to reduce from Subset Partition to this problem.