Problem 2417. all possible subsets of set
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]};
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers24
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15595 Solvers
-
306 Solvers
-
434 Solvers
-
1404 Solvers
-
Permute diagonal and antidiagonal
456 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!