Dynamic Two-Array Pair Sum Queries
Asked at Capital One · Coding & Leetcode-style Questions · Difficulty: Medium · Last asked Jun 5, 2026
Maintain arrays `a` and `b` under point updates to `a`. For each sum query, append the number of `(a[i], b[j])` pairs whose values add to the requested target.
Loading the problem…
More Capital One interview questions
- Implement Top-P (Nucleus) Sampling
- Design a Customer-Service Chatbot for Capital One
- Capital One Power Day Behavioral (STAR)
- Amusement Park Profitability Case
- MLE Deployment, Monitoring & Latency Optimisation
- Reliable Account Balance Service and Cross-Region Event Platform