{"id":"fair-candy-swap-set-complement-search","text":"Fair Candy Swap uses the same set-based complement search pattern as Two Sum: build a hash set from one collection, then scan the other checking for computed complements — O(n+m) time, O(m) space.","truth_value":"IN","source":"entries/2026/06/06/fair-candy-swap-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"fair-candy-swap-set-complement-search","truth_value":"IN","reason":"premise"}]}}