problem78

README

< Previous 　　　　　　　　　　　　　　　　 Next >

78. Subsets (Medium)

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

Related Topics

[Bit Manipulation] [Array] [Backtracking]

Similar Questions

1. Subsets II (Medium)
2. Generalized Abbreviation (Medium)
3. Letter Case Permutation (Easy)