You are given 2 arrays A, B sorted in decreasing order of size m and n respectively and a number k, such that 1 <= k <= m*n. You need to fine the kth largest sum(a+b) possible where a \in A, and b \in B.
Hint: i like this problem, a possible solution is by induction and the complexity is O(n+m).
A Berkeley Commencement Speech, Some Years Ago… - The post A Berkeley Commencement Speech, Some Years Ago… appeared first on John Battelle's Search Blog. Last week LinkedIn asked me to post a commencemen...
19 minutes ago