← Drishti-Soft Solutions questions

Equal Sum Subset Partitioning

Filed under Drishti-Soft Solutions

The question

Given a set of integers, identify two subsets such that the sum of the elements in each subset is equal. For example, given {4, 2, 1, 1, 5, 3}, one subset could be {4, 2, 1, 1} and the other {5, 3}, both summing to 8.

No write-up yet. Related questions below have one.

Related Drishti-Soft Solutions questions

Collected from public candidate posts and coding forums. Updated Nov 2026.