← Questions
Subsets, with and without backtracking
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return every subset of a set of distinct numbers using backtracking, then write it again iteratively, without backtracking, by building subsets up or using bit masks. Reported in a loop that also asked a tree traversal on a class you define and a simple BFS.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding