{"id":"two-sum-less-than-k-time-complexity","text":"The algorithm runs in O(n log n) time and O(1) auxiliary space via sort + two-pointer","truth_value":"IN","source":"entries/2026/06/06/two-sum-less-than-k-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-less-than-k-time-complexity","truth_value":"IN","reason":"premise"}]}}