Subset sum problem: Difference between revisions

Implement a function/procedure/method/subroutine that takes a set/array/list/stream/table/collection of words with integer weights, and identifies a non-empty subset of them whose weights sum to zero (cf. the Dropbox [http://www.dropbox.com/jobs/challenges Diet] candidate screening exercise and the [[wp:Subset sum problem|Subset sum problem]] Wikipedia article).

 

This set of weighted words, one solution would be the set of words:

:::*   {elysee,   efferent,   deploy,   departure,   centipede,   bonnet,   balm,   archbishop}