Explain backtracking.
01
01
Understand the problem
backtracking
02
02
Attempt it yourself
Sketch your approach before reading the solution — that's what interviews test.
Stuck? AI Nudge Available
Get a conceptual hint to guide your logic without spoiling the final implementation.
03
03
Study the solution
The solution is waiting
Give it an honest attempt first — then compare your thinking with the full walkthrough.
04
04
Read the code
Generate all subsets
Run Playgrounddef subsets(nums):
result, path = [], []
def backtrack(start):
result.append(path[:]) # record a copy
for i in range(start, len(nums)):
path.append(nums[i]) # choose
backtrack(i + 1) # explore
path.pop() # un-choose
backtrack(0)
return result
# --- demo ---
print(subsets([1, 2, 3])) # [[], [1], [1,2], [1,2,3], [1,3], [2], [2,3], [3]]05
05
Join the discussion
Discussion (0)
Sign in to join the discussion.
No responses yet. Be the first to share what you think.