// TOPIC
#backtracking
3 articles
◆◆IntermediateMetaAmazon
01Subsets, Permutations & Combinations
Generate every subset, permutation, and combination with the choose/explore/un-choose backtracking template. Understand the 2^n and n! complexity ceilings, why sorting kills duplicate branches, and how to recognize which variant a problem is actually asking for.
#backtracking#recursion#combinatorics
12 min◆◆IntermediateAmazonGoogle
02DFS Patterns
Depth-first search is the backbone of cycle detection, flood fill, path enumeration, and clone graph — master the visited-set template, the 3-color trick, and when to reach for DFS over BFS.
#graphs#dfs#traversal
13 min◆◆IntermediateGoogleMeta
03Backtracking
Learn the backtracking algorithm pattern — the systematic brute force that prunes itself. Master the universal choose-explore-unchoose template and apply it to subsets, permutations, combination sum, and N-queens.
#backtracking#recursion#combinatorics
10 min