← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
Given two sorted arrays a of size m and b of size n, and a positive integer k (1 ≤ k ≤ m + n), find the k-th largest element in the combined sorted sequence of all elements from both arrays. You must design an efficient algorithm that does not explicitly merge the arrays. The arrays are sorted in non-decreasing order and may contain duplicates.