Kth Smallest Element in a Sorted Matrix || Leetcode Medium 378 || Priority Queue

Given an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix.

Note that it is the kth smallest element in the sorted order, not the kth distinct element.

You must find a solution with a memory complexity better than O(n^2)


Example 1:

Input: matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8
Output: 13
Explanation: The elements in the matrix are [1,5,9,10,11,12,13,13,15], and the 8th smallest number is 13
Example 2:

Input: matrix = [[-5]], k = 1
Output: -5

Get notified about all off campus jobs/interviews and the process.
We are building our website and it will be back soon with lots of content till then subscribe us on youtube.
t.me/tech_geek1

Interview Preparation Sheet:    • INTERVIEW PREPARATION SHEET - HASHEDI...  

Link for Leetcode solutions:    • Leetcode Solutions  

Link for placement series:
Placement 2022:    • Placements 2022  
Placement 2023:    • Placements 2023  

#leetcode #leetcodesolution