Solution: Kth Smallest Element in a Sorted Matrix

Let's solve the Kth Smallest Element in a Sorted Matrix problem using the K-Way Merge pattern.

Statement

Find the kthk^{th} smallest element in an (n×n)(n \times n) matrix, where each row and column of the matrix is sorted in ascending order.

Although there can be repeating values in the matrix, each element is considered unique and, therefore, contributes to calculating the kthk^{th} smallest element.

Constraints:

  • n ==== matrix.length
  • n ==== matrix[i].length
  • 11\leq n 100\leq100
  • 103-10^3\leq matrix[i][j] 103\leq10^3
  • 11\leq k n2\leq n^2

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.