8 views
# Bit DP Subsets (Practice 4721): Warm-up Interviewers love bit dp subsets because it checks whether you can state the invariant before coding. Here is a compact rehearsal note. ## Approach Iterate masks; transition by adding an unused element. ```python def subset_sum(nums, target): reachable = {0} for x in nums: reachable |= {s + x for s in reachable if s + x <= target} return target in reachable ``` ## Complexity Linear in the dominant input size for the scan; heap/tree variants add a log factor. ## Interview pitfalls State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode. ## Practicing out loud Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see [Linkjob AI interview assistant](https://www.linkjob.ai/).