# Find All Subsets

Posted: 23 Jul, 2021

Difficulty: Easy

#### You are given an array ‘arr’ of ‘N’ distinct integers. Your task is to find all the non-empty subsets of the array.

#### Note: You can return the subsets in any order, you don’t have to specifically sort them.

##### Input Format :

```
The first line contains a single integer ‘T’ denoting the number of test cases, then each test case follows
The first line of each test case contains a single integers ‘N’ denoting the length of the array.
The second line of each test case contains ‘N’ integers denoting the array elements.
```

##### Output Format :

```
For each test case print each subset in a separate line.
Output for each test case will be printed in a separate line.
```

##### Note :

```
You are not required to print anything; it has already been taken care of. Just implement the function.
```

##### Constraints :

```
1 <= T <= 10
1 <= N <= 10
10^-9 <= arr[i] <= 10^9
Time limit: 1 sec
```

SIMILAR PROBLEMS

Check whether K-th bit is set or not

Posted: 20 May, 2022

Difficulty: Easy

Combination Sum III

Posted: 25 May, 2022

Difficulty: Moderate

Combination Sum III

Posted: 25 May, 2022

Difficulty: Moderate

Generate All Strings

Posted: 9 Jul, 2022

Difficulty: Moderate

Maximum Element

Posted: 21 Jul, 2022

Difficulty: Moderate

XOR DARE

Posted: 3 Sep, 2022

Difficulty: Moderate