Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Kth Smallest Element in Sorted Matrix
Bookmark
Sort All
Min-Heap
Binary Search
Input
Example 1 (3x3, k=8)
Example 2 (2x2, k=2)
4x4 matrix (k=5)
5x5 matrix (k=13)
Single element
Custom
matrix
=
[[1,5,9],[10,11,13],[12,13,15]]
,
k
=
8
k =
8
1
5
9
10
11
13
12
13
15
flatten every cell into one list, sort it, read index k - 1
k =
8
1
5
9
10
11
13
12
13
15
flatten every cell into one list, sort it, read index k - 1
k =
8
elements =
1
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
append matrix[0][0] =
1
k =
8
elements =
2
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
append matrix[0][1] =
5
k =
8
elements =
4
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
9
2
10
3
append matrix[1][0] =
10
k =
8
elements =
5
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
9
2
10
3
11
4
append matrix[1][1] =
11
k =
8
elements =
6
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
9
2
10
3
11
4
13
5
append matrix[1][2] =
13
k =
8
elements =
7
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
9
2
10
3
11
4
13
5
12
6
append matrix[2][0] =
12
k =
8
elements =
9
/ 9
1
5
9
10
11
13
12
13
15
elements, in row order
1
0
5
1
9
2
10
3
11
4
13
5
12
6
13
7
15
8
append matrix[2][2] =
15
k =
8
elements =
9
/ 9
1
5
9
10
11
13
12
13
15
elements, sorted
1
0
5
1
9
2
10
3
11
4
12
5
13
6
13
7
15
8
sorted ascending → the answer sits at index
k - 1 = 7
k =
8
elements =
9
/ 9
1
5
9
10
11
13
12
13
15
elements, sorted
1
0
5
1
9
2
10
3
11
4
12
5
13
6
13
7
15
8
8th smallest = 13
algo
master
.
io
Step:
Flatten every cell into one list, sort it, then read index k - 1
0 / 11
Input
Example 1 (3x3, k=8)
Example 2 (2x2, k=2)
4x4 matrix (k=5)
5x5 matrix (k=13)
Single element
Custom
matrix
=
[[1,5,9],[10,11,13],[12,13,15]]
,
k
=
8
0 / 11
algo
master
.
io
Step:
Flatten every cell into one list, sort it, then read index k - 1
