What is the time complexity of subsets (power set)?

Worst case O(n × 2ⁿ). Space complexity is O(n).

Subsets (power set)

medium

In or out, n times, giving 2ⁿ outcomes. Every subset corresponds to a bitmask, which is the bridge from backtracking to bitmask dynamic programming.

Worst O(n × 2ⁿ)Space O(n)

Loading the subsets (power set) engine…

Swap in place, recurse, swap back.

Set, clear, toggle - and the two identities worth memorising.

Take it or leave it, at every capacity.