Multiple Subset Sum Solver

It solves subset sum problem and multiple subset sum problem. This program was implemented in Rust and WebAssembly. The calulation is done in your browser without communicating with servers.

Please input values below.

Subset array (required) Use all the values in the list for the answer.

Target array or value (required) Use all the values in the list for the answer.

Maximum subset length (required) Restricts the maximum length of subset for a result. E.g. If 3 the array would be like [1 + 2 + 3] or [4 + 7].

Maximum target length (required)

The number of candidates (required when target is an array)

Solving subset sum problem and multiple subset sum problem.