Subsequence Patterns | Power Set | Subsets

Pattern 1 - Find all Subsequences Given an integer array nums of unique elements, return all possible (link) subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example 1: Input: nums = [1,2...