Login

Striver SDE Sheet Problems

Problem title

Difficulty

Avg time to solve

Print All Subsets

Easy

20 mins

Floyd Warshall

Moderate

40 mins

Bellman Ford

Moderate

30 mins

Find All Subsets

Easy

15 mins

Get Path using BFS

Easy

25 mins

Zero Pair Sum

Moderate

20 mins

Get DFS Path

Easy

15 mins

Construct Binary Tree From Inorder and Preorder Traversal

Easy

10 mins

Find Number Of Islands

Moderate

34 mins

Subset Sum Equal To K

Moderate

30 mins

Problem

Submissions

0

Avg. time to solve

15 min

Success Rate

90%

Problem Statement

```
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.
```

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

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

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

```
2
3
1 2 3
1
10
```

```
1
1 2
1 2 3
1 3
2
2 3
3
10
```

```
For test case 1 :
Total 7 possible subsets can be formed: {1}, {1,2}, {1,2,3}, {1,3}, {2}, {2,3}, {3}
For test case 2 :
Only a single subset {10} is possible for the given input array.
```

```
2
2
1 2
3
1 2 3
```

```
1
1 2
2
1
1 2
1 2 3
1 3
2
2 3
3
```

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Language

Change Theme

Solution submission not allowed

Save Code

Reset Code