Prime In Diagonal
Let’s create a solution for finding the largest prime number that lies on at least one of the diagonals of a given twodimensional array.
Understanding the Problem
We need to find the largest prime number from the elements that are on the diagonals of the given square matrix.
Approach
 Find Diagonal Elements: Iterate through the main diagonal and the antidiagonal of the matrix and collect the elements.
 Check Prime: Write a function to check if a number is prime. We can do this by checking if the number has any divisors other than 1 and itself.
 Find the Largest Prime: Iterate through the collected elements and find the largest prime number.
Implementation


Examples
 For
nums = [[1,2,3],[5,6,7],[9,10,11]]
, the largest prime on the diagonals is11
.  For
nums = [[1,2,3],[5,17,7],[9,11,10]]
, the largest prime on the diagonals is17
.
Complexity
The time complexity of this solution is O(n * sqrt(m))
, where n
is the size of the matrix, and m
is the largest number in the matrix. The space complexity is O(1)
since we are only using a constant amount of extra space.