what is a general algorithm to compute if a set have nonempty integer subset that have integers add up to 0?
i would like to know one with the least tries and the proof of it.
Example:{−2, −3, 15, 14, 7, −10} have integers added up to zeros since {−2, −3, −10, 15} add up to zero
i would also like to know the level of it - undergraduate or graduate?