Write a program to find all subsets of a given set.
MediumProblem Statement
Write a program to find all subsets of a given set.
Sample Input
Set: [1, 2, 3]
Sample Output
Subsets: [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
Limits
Time: 2s · Memory: 256 MB
Code Editor
00:00
fun findSubsets(nums: List<Int>): List<List<Int>> {
// Add your code here to find subsets
}
fun main() {
val nums = listOf(1, 2, 3)
println("Subsets: ${findSubsets(nums)}")
}
Input
Set: [1, 2, 3]
Expected Output
Subsets: [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]