Re:Ask HN: With N numbers, determine if a tie is possible?
by friggeri on Sunday November 04, 2012 @12:56AM
(#4738991)
This is the partition problem[1]. So to answer your question: the problem is NP-complete, but there are pseudo-polynomial time dynamic programming solutions (see the wikipedia entry for details).
[1]: http://en.wikipedia.org/wiki/Partition_problem