Solving Kth Smallest Element in a Sorted Matrix in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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

Example:

matrix = [
   [ 1,  5,  9],
   [10, 11, 13],
   [12, 13, 15]
],
k = 8,

return 13.

See the full details of the problem Kth Smallest Element in a Sorted Matrix at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go