You are given a $2$D integer array nums representing a square matrix.

Return the largest prime number that lies on at least one of the diagonals of nums. If no prime number is present on any diagonal, return $0$.

Note:

• An integer is prime if it is strictly greater than $1$ and cannot be formed by multiplying two smaller positive integers.

• The diagonals of nums include all elements nums[i][i] and nums[i][nums.length - i - 1] for $0 \leq i <$ nums.length.

Constraints:

• $1 \leq$ nums.length $\leq 300$

• nums.length $==$ nums[i].length

• $1 \leq$ nums[i][j] $\leq 4 imes 10^6$

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.