Solving subset sum problem and multiple subset sum problem.

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.

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

Go back to the main page.