Given a two dimensional integer array matrix with m rows and n columns, determine whether the integer target exists in matrix. Return true if target is present, otherwise return false.

The array matrix is sorted such that each row is in nondecreasing order, and the first element of each row is greater than the last element of the previous row.

Constraints:

• m == matrix.length

• n == matrix[i].length

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

• $-10^4 \leq$ matrix[i][j], target $\leq 10^4$

Now, 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.