Just keep a limit of k elements in Max heap and keep popping & adjusting accordingly. In the final step, we get the top element as Min K element. This approach would have worked if even if the matrix ...

AnilYadavGitHub / Leetcode-378.-Kth-Smallest-Element-in-a-Sorted-Matrix Public Notifications Fork Star ...