A peak element in a $2$D grid is defined as an element that is strictly greater than all of its adjacent neighbors situated directly above, below, to the left, and to the right.

Given an $m imes n$ integer matrix mat where no two adjacent cells have equal values, find any peak element and return its coordinates as [i, j], representing the row and column indices.

You may assume that the entire matrix is surrounded by an outer border of cells containing the value $-1$.

Constraints:

• m $==$ mat.length

• n $==$ mat[i].length

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

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

• No two adjacent cells are equal.

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.