Available question text
Given an n×n integer matrix, return the largest prime number that appears on either the main diagonal or the anti-diagonal (or 0 if none). Note: n ≤ 300 and values ≤ 4×10^6, so primality checks must handle numbers up to a few million efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2614. Prime In Diagonal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source