{"id":"set-complement-lookup-pattern","text":"The `find_K` solution and related problems (Two Sum family) use a set-complement idiom: build a set for O(1) membership, then iterate checking for a complementary value — a recurring O(n) pattern across the repo.","truth_value":"IN","source":"entries/2026/06/06/largest-positive-integer-that-exists-with-its-negative-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"set-complement-lookup-pattern","truth_value":"IN","reason":"premise"}]}}