Available question text
Find the two prime numbers within [left, right] whose difference is minimal (break ties by the smaller first number), returning [-1, -1] if fewer than two primes exist. Constraint left, right ≤ 10^6 means you must efficiently enumerate/check primes and scan adjacent primes to find the closest pair.
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 2523. Closest Prime Numbers in Range
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source