Given an $m \times n$ matrix of distinct numbers, return the lucky number in the matrix.

A lucky number is an element of the matrix such that it is the smallest element in its row and largest in its column.

Constraints:

• $m =$ matrix.length

• $n =$ matrix[i].length

• $1 \leq n$, $m \leq 50$

• $1 \leq$ matrix[i][j] $\leq 10^5$

• All elements in the matrix are distinct.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.