Subsets

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Subsets** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Include/exclude DFS or bitmask **Edge Cases to Consider:** - (1) Empty array (one empty subset) - (2) All same elements - (3) n > 20 (large output)

Examples

Example 1

Input: [1,2,3]

Output: [[],[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]

Explanation: 8 subsets

Example 2

Input: [0]

Output: [[],[0]]

Explanation: 2 subsets

Example 3

Input: []

Output: [[]]

Explanation: Just empty set

Constraints

▪Input arguments are within valid ranges
▪Optimize for execution speed
▪Handle null/empty inputs gracefully

Watch Out For Edge Cases

▪Empty array (one empty subset)
▪All same elements
▪n > 20 (large output)

Frequently Asked At

AmazonGoogleMicrosoftMetaAdobe

Back to Arena

medium

Backtracking