Status: IN
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.
Source: entries/2026/06/06/fair-candy-swap-solution.md
JSON