Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Kth Smallest Element in a Sorted Matrix

Understand how to find the kth smallest element in an n x n sorted matrix by treating each row as a sorted list and using a min-heap in the K-way merge algorithm. Learn to efficiently push and pop elements to track the kth smallest value, analyzing time and space complexity of the solution.

We'll cover the following...

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
  • 1≤1\leq n ≤100\leq100
  • −103≤
...