Skip to interview prep
Apexed

254. Given arrays A and B of size n, how do you find a ∈ A and b ∈ B with a + b = K in O(n log n)? How does this extend to three arrays?

MediumSorting

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Given arrays A and B of size n, how do you find a ∈ A and b ∈ B with a + b = K in O(n log n)? How does this extend to three arrays — Data structures & algorithm