New update is available. Click here to update.

Find All Subsets

Posted: 23 Jul, 2021
Difficulty: Easy


Try Problem

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