{"id":"two-sum-iii-add-find-asymmetry","text":"`TwoSum` optimizes `add()` to O(1) at the cost of O(n) `find()`; the inverse tradeoff (precompute all sums on add, O(1) find) would be better when finds dominate.","truth_value":"IN","source":"entries/2026/06/06/two-sum-iii-data-structure-design-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["two-sum-family-spans-lookup-strategy-space"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"two-sum-iii-add-find-asymmetry","truth_value":"IN","reason":"premise"}]}}