Kth smallest in matrix
Given an n x n matrix where each row and each column is sorted in ascending order, return the k-th smallest element in the matrix (in overall sorted order). 1 <= n <= 300 and 1 <= k <= n*n. Aim to beat O(n^2 log n).
Implement
kth_smallest_matrix(matrix: list[list[int]], k: int) → intExamples
in
[[[1,5,9],[10,11,13],[12,13,15]],8]out13What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[[1,5,9],[10,11,13],[12,13,15]],8]13not run yetsample