Two Arrays: Count Pairs Summing to a Target Under Updates

Also reported as Finding Pairs With a Certain Sum (LeetCode 1865)

OACapital OneLast reported June 2026Low Frequency

Problem Overview

A oa question, reconstructed from 3 candidate reports. Sign in to read the write-up.

The problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Free with an account

This question is free. Create an account to read the write-up, the candidate-reported follow-ups and the walkthrough.

Already have an account? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.