Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > K-th of Two Sorted Arrays > Editorial

K-th of Two Sorted Arrays — Solution & Editorial

Back to the Problem

Merge with two pointers, stopping after K steps — no need to materialize the merged array. (Binary search does it in O(log) if you want the challenge.)

Complexity: O(K)