Glean Tech Phone Screen Interview: Find the Kth Largest Number from Two Sorted Arrays

Glean software engineer phone interview features a problem to find the Kth largest number from two sorted arrays. Practice this common algorithm challenge.