Subsets

Question 1

What is the definition of Subsets?

Answer 1

Generates all possible subsets of a set.

Use Case: Combinatorial problems, power set.

Example: [No LeetCode match, course example: Subsets].

Question 2

What are the key steps for Subsets?

Answer 2

1. Start with empty subset.
2. For each element, create new subsets by adding it.
3. Return all subsets.

Action: Explain steps for Subsets aloud.

Question 3

How does it apply to Subsets?

Answer 3

Problem: Generate all subsets of a set.
Approach: Iteratively add each element to existing subsets.

Example: Subsets. Action: Verbalize solution logic aloud.

Question 4

What are the complexity and gotchas of Subsets?

Answer 4

Complexity: Time: O(2^n), Space: O(2^n).
Gotchas: Empty set, duplicate elements.

Action: List edge cases for Subsets aloud.

Question 5

Code example for Subsets.

Answer 5

```python
from typing import List
def subsets(nums: List[int]) -> List[List[int]]:
result: List[List[int]] = [[]]
for num in nums:
result += [subset + [num] for subset in result]
return result
~~~