Subset Generation with Bits

Category: Bit Manipulation

Difficulty: intermediate

Description: Generate subsets using bitmasks

Time Complexity: O(2^n * n)

Space Complexity: O(1)

Related LeetCode Problems

• 78. Subsets (Medium)
• 90. Subsets II (Medium)
• 46. Permutations (Medium)
• 47. Permutations II (Medium)
• 401. Binary Watch (Easy)
• 78. Subsets (duplicate for bitmask pattern) (Medium)
• 784. Letter Case Permutation (Medium)
• 1986. Minimum Number of Work Sessions to Finish the Tasks (Medium)
• 473. Matchsticks to Square (Medium)
• 1125. Smallest Sufficient Team (Hard)
• 1415. The k-th Lexicographical String of All Happy Strings of Length n (Medium)
• 1239. Maximum Length of a Concatenated String with Unique Characters (Medium)
• 2044. Count Number of Maximum Bitwise-OR Subsets (Medium)
• 980. Unique Paths III (Hard)