DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master subset generation with backtracking — generating all 2^n subsets, subsets with duplicates, combinations of size k, combination sum, partitions, power set using bitmask approach, and understanding which problems require subsets versus combinations versus permutations.
What Is a Subset?
A subset of a set S is any collection of elements from S (including the empty set and S itself). For a set of n elements, there are exactly 2^n subsets.
Example
S = {1, 2, 3}
All 2³ = 8 subsets:
{}
{1}
{2}
{3}
{1, 2}
{1, 3}
{2, 3}
{1, 2, 3}
Approach 2 — Bitmask Method
Use an integer from 0 to 2^n - 1. Each bit position represents whether the corresponding element is included.
Example
def all_subsets_bitmask(nums):
"""
Generate all subsets using bitmask.
Bit i of mask = 1 means nums[i] is included.
Time: O(2^n × n), Space: O(1) extra
"""
n = len(nums)
result = []
for mask in range(1 << n): # 0 to 2^n - 1
subset = []
for i in range(n):
if mask & (1 << i): # If bit i is set
subset.append(nums[i])
result.append(subset)
return result
print(all_subsets_bitmask([1, 2, 3]))
# [[], [1], [2], [1,2], [3], [1,3], [2,3], [1,2,3]]
| Bitmask | Subset: |
| 000 (0) | [] |
| 001 (1) | [1] (bit 0 set) |
| 010 (2) | [2] (bit 1 set) |
| 011 (3) | [1,2] (bits 0,1 set) |
| 100 (4) | [3] (bit 2 set) |
| 101 (5) | [1,3] (bits 0,2 set) |
| 110 (6) | [2,3] (bits 1,2 set) |
| 111 (7) | [1,2,3] (all bits set) |
Subsets with Duplicates
If the input has duplicates, we need to avoid generating duplicate subsets:
Example
def subsets_with_dups(nums):
"""
Generate unique subsets when input contains duplicates.
Key: Sort first, then skip duplicate elements at same recursion level.
"""
nums.sort() # MUST sort first
result = []
def backtrack(start, current):
result.append(list(current))
for i in range(start, len(nums)):
# Skip duplicates at the same recursion level
if i > start and nums[i] == nums[i-1]:
continue # ← Skip duplicate
current.append(nums[i])
backtrack(i + 1, current)
current.pop()
backtrack(0, [])
return result
print(subsets_with_dups([1, 2, 2]))
# [[], [1], [1,2], [1,2,2], [2], [2,2]]
# Without dedup: [[], [1], [1,2], [1,2,2], [1,2], [2], [2,2], [2]] ← duplicates!
Combinations of Size K
Generate all subsets of exactly size k:
Example
def combinations(nums, k):
"""
Generate all subsets of exactly size k (C(n,k) combinations).
Time: O(C(n,k) × k), Space: O(k)
"""
result = []
def backtrack(start, current):
if len(current) == k:
result.append(list(current))
return
# PRUNING: Not enough elements left to reach size k
remaining_needed = k - len(current)
remaining_available = len(nums) - start
if remaining_available < remaining_needed:
return # Can't possibly reach size k — prune
for i in range(start, len(nums)):
current.append(nums[i])
backtrack(i + 1, current)
current.pop()
backtrack(0, [])
return result
print(combinations([1, 2, 3, 4], 2))
# [[1,2],[1,3],[1,4],[2,3],[2,4],[3,4]]
print(len(combinations(list(range(1, 11)), 5))) # 252 = C(10,5)
Combination Sum (Can Reuse Elements)
Example
def combination_sum(candidates, target):
"""
Find all combinations that sum to target.
Each number can be used multiple times.
"""
candidates.sort()
result = []
def backtrack(start, current, remaining):
if remaining == 0:
result.append(list(current))
return
for i in range(start, len(candidates)):
if candidates[i] > remaining:
break # Sorted: all further candidates are larger too
current.append(candidates[i])
backtrack(i, current, remaining - candidates[i]) # i (not i+1) = reuse allowed
current.pop()
backtrack(0, [], target)
return result
print(combination_sum([2, 3, 6, 7], 7)) # [[2,2,3],[7]]
print(combination_sum([2, 3, 5], 8)) # [[2,2,2,2],[2,3,3],[3,5]]
Partition Set into Two Equal Sum Subsets
Example
def can_partition(nums):
"""
Can the array be partitioned into two subsets with equal sum?
"""
total = sum(nums)
if total % 2 != 0:
return False
target = total // 2
def backtrack(start, current_sum):
if current_sum == target:
return True
if current_sum > target or start == len(nums):
return False
# Try including nums[start]
if backtrack(start + 1, current_sum + nums[start]):
return True
# Skip including nums[start]
return backtrack(start + 1, current_sum)
return backtrack(0, 0)
print(can_partition([1, 5, 11, 5])) # True — {1,5,5} and {11}
print(can_partition([1, 2, 3, 5])) # False
All Partitions of a Set
Example
def set_partitions(nums):
"""
Generate all ways to partition nums into non-empty groups.
Bell number B(n): B(1)=1, B(2)=2, B(3)=5, B(4)=15, B(5)=52...
"""
result = []
def backtrack(idx, groups):
if idx == len(nums):
result.append([list(g) for g in groups])
return
# Option 1: Add nums[idx] to an existing group
for group in groups:
group.append(nums[idx])
backtrack(idx + 1, groups)
group.pop()
# Option 2: Start a new group with nums[idx]
groups.append([nums[idx]])
backtrack(idx + 1, groups)
groups.pop()
backtrack(0, [])
return result
partitions = set_partitions([1, 2, 3])
print(f"Number of partitions of 3-element set: {len(partitions)}") # 5 (Bell number B(3))
Subsets vs Combinations vs Permutations
| Problem | Order matters? | Repetition? | Count | Algorithm |
|---|---|---|---|---|
| Subsets | No | No | 2^n | Backtrack with start index |
| Combinations C(n,k) | No | No | C(n,k) | Backtrack, size limit |
| Permutations | Yes | No | n! | Backtrack, swap |
| Combinations w/ rep. | No | Yes | C(n+k-1,k) | Backtrack, same start |
| Permutations w/ rep. | Yes | Yes | n^k | Backtrack, no start |
Summary
Subset generation is foundational to many backtracking problems:
- All subsets: Backtrack with include/exclude at each position — O(2^n × n)
- Bitmask: Iterate 0 to 2^n-1, check bits — same complexity, simpler code
- With duplicates: Sort first, skip adjacent duplicates at same level
- Combinations of size k: Add length check as base case + pruning
- Combination sum: Add target check, allow element reuse with same start index
The pattern of "make a choice, recurse, undo" applies to all these variants. The only thing that changes is when the base case fires and which elements are available at each step.
*Next Lesson: Backtracking Problems*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Subset Generation — All Subsets, Combinations, and Partitions with Backtracking.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, backtracking, subset, generation
Related Data Structures & Algorithms Topics
Continue learning this concept
BacktrackingBacktracking — The Complete Guide to Recursive Exploration with UndoMaster backtracking from the ground up — what backtracking is, how it differs from brute force, the universal backtracking template, state space tree visualization, pruning strategies that make backtracking efficient, and when to apply backtracking versus dynamic programming.BacktrackingBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsSolve 12 classic backtracking interview problems — word search, letter combinations of phone number, palindrome partitioning, restore IP addresses, permutations II with duplicates, combination sum II, beautiful arrangements, word break II, expression add operators, and more.BacktrackingN-Queens Problem — Complete Solution with Backtracking and OptimizationMaster the N-Queens problem completely — problem definition, why queens attack each other, step-by-step backtracking solution, constraint checking using column and diagonal sets, optimized solution with bitmasks, counting total solutions, and visualizing the complete search tree.BacktrackingRat in a Maze — Backtracking Path Finding with All SolutionsMaster the Rat in a Maze problem — finding all paths from source to destination in a binary grid, backtracking with visited tracking, directional movement (4-directional and 8-directional), finding shortest path, path reconstruction, and variations including multiple exit points.BacktrackingSudoku Solver — Backtracking with Constraint PropagationMaster Sudoku solving with backtracking — the rules of Sudoku, basic backtracking solver, O(1) validity checking with sets, naked singles optimization, constraint propagation, forward checking, and how to build an efficient solver that handles even hard Sudoku puzzles.RecursionBacktracking Introduction — The Recursive Exploration with UndoMaster backtracking — the algorithmic technique for finding all solutions by recursively exploring choices and undoing them when they lead to dead ends. Learn the backtracking template, pruning strategies, and classic examples: N-Queens, Sudoku solver, and combination sum.