K-th element of two sorted Arrays (Medium) | Binary Search | Problem-solving | GFG

K-th element of two sorted Arrays is a medium-level question posted on GeeksforGeeks (GFG). In this video, we have solved the question in an efficient method.

The problem statement says that:
Given two sorted arrays arr1 and arr2 of size N and M respectively and an element K. The task is to find the element that would be at the k’th position of the final sorted array.