Subsets & Combinations - SubsetsGiven the following code snippet, what is the output when calling subsets([1, 2])?A[[], [2], [1], [1, 2]]B[[], [1], [2], [1, 2]]C[[1], [2], [1, 2]]D[[1, 2], [1], [2], []]Check Answer
Step-by-Step SolutionSolution:Step 1: Trace mask values from 0 to 3 for nums=[1,2]mask=0 -> [], mask=1 -> [1], mask=2 -> [2], mask=3 -> [1,2]Step 2: Collect subsets in order of maskResult is [[], [1], [2], [1, 2]]Final Answer:Option B -> Option BQuick Check:Bitmask enumeration includes empty subset first [OK]Quick Trick: Bitmask 0 corresponds to empty subset [OK]Common Mistakes:MISTAKESForgetting empty subset at mask=0Misordering subsetsTrap Explanation:PITFALLCandidates often forget the empty subset or misorder subsets when tracing bitmask loops.Interviewer Note:CONTEXTTests ability to mentally execute bitmask subset generation
Master "Subsets" in Subsets & Combinations3 interactive learning modes - each teaches the same concept differentlyTry ItSolutionTrace
More Subsets & Combinations Quizzes Combination Sum II (No Reuse, Duplicates) - Combination Sum II (No Reuse, Duplicates) - Quiz 2easy Combination Sum III (K Numbers to N) - Combination Sum III (K Numbers to N) - Quiz 6medium Count Number of Max Bitwise-OR Subsets - Count Number of Max Bitwise-OR Subsets - Quiz 3easy Count Number of Max Bitwise-OR Subsets - Count Number of Max Bitwise-OR Subsets - Quiz 4medium Count of Subsets With Sum K - Count of Subsets With Sum K - Quiz 4medium Letter Case Permutation - Letter Case Permutation - Quiz 6medium Matchsticks to Square - Matchsticks to Square - Quiz 8hard Matchsticks to Square - Matchsticks to Square - Quiz 10hard Partition to K Equal Sum Subsets - Partition to K Equal Sum Subsets - Quiz 2easy Subsets II (With Duplicates) - Subsets II (With Duplicates) - Quiz 15hard