Grokking the Coding Interview: Patterns for Coding Questions

Solution: Subsets

## Problem Statement

Given a set with distinct elements, find all of its distinct subsets.

**Example 1**:
```
Input: [1, 3]
Output: [], [1], [3], [1,3]
```

**Example 2**:
```
Input: [1, 5, 3]
Output: [], [1], [5], [3], [1,5], [1,3], [5,3], [1,5,3]
```

**Constraints:**

- `1 <= nums.length <= 10`
- `-10 <= nums[i] <= 10`
- All the numbers of nums are `unique`.

## Solution

To generate all subsets of the given set, we can use the **Breadth First Search (BFS)** approach. We can start with an empty set, iterate through all numbers one-by-one, and add them to existing sets to create new subsets