Problem 43. Subset Sum

Created by Cody Team
Appears in Matrix Manipulation I

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Given a vector v of integers and an integer n, return the the indices of v (as a row vector in ascending order) that sum to n. If there is no subset in v that sums to n, return an empty matrix []. You can assume that the answer will always be unique.

Example:

 >> v = [2, 3, 5];
 >> n = 8;
 >> subset_sum(v, n)
 ans =
      2     3

Solve

Solution Stats

5204 Solutions
1937 Solvers

Last Solution submitted on Feb 07, 2025

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Daniel Pereira on 8 May 2014

Use nchoosek instead of combnts or combnk

Thonigon on 8 Mar 2016

At first I thought that it was quite difficult to look for the sets of elements of any size (sets of 1 element, 2 elements and so on), but then I realised that any selection of the vector elements correspond to a binary code ('1' for selecting that element and '0' for not selecting it). To select all possible elements combinations I only need to use the binary code from 1 to 2^(1+length(v))-1.

Thonigon on 8 Mar 2016

Solution Comments

Show comments

Problem Recent Solvers1937

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 43. Subset Sum

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1937

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Problem 43. Subset Sum

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers1937

Suggested Problems

More from this Author96

Problem Tags

Community Treasure Hunt

Players