{"id":"sort-then-two-pointer-pattern","text":"The sort + two-pointer squeeze pattern (used in `two-sum-less-than-k`) recurs across multiple solutions for pair-sum optimization, converting O(n^2) brute force into O(n log n)","truth_value":"IN","source":"entries/2026/06/06/two-sum-less-than-k-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["sort-preprocessing-enables-linear-scan","two-pointer-primary-linear-array-technique"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-then-two-pointer-pattern","truth_value":"IN","reason":"premise"}]}}