Solving Subsets in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example:

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

See the full details of the problem Subsets at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go