Problem 2417. all possible subsets of set

Created by rifat

Solve Later

Given a vector, return all possible subsets of the vector in a cell array. Properties of basic set theory is assumed to be valid here e.g no repeated element, empty-set being a subset etc. Consider NaNs to be equal for this problem. Within a subset, sort all the elements. Any NaNs should appear at the beginning in the sorted subset.

Example:

Input : x=[1 2 3];
Output: y ={[],[1],[2],[3],[1 2],[1 3],[2 3],[1 2 3]};

Solve

Solution Stats

Last solution submitted on Sep 29, 2019

Last 200 Solutions

Solution Comments

Solution 858845

1 Comment

1 Comment

Tim Wilkin on 5 Sep 2019

This is not a valid solution. It does not meet the requirement of elements in each subset being sorted. Try the input [1 3 2] and it does not give sorted subsets.

Problem Recent Solvers15

Problem Tags

Problem 2417. all possible subsets of set

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers15

Suggested Problems

More from this Author45

Problem Tags

Problem 2417. all possible subsets of set

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers15

Suggested Problems

More from this Author45

Problem Tags

Players