Available question text
Find all prime pairs (x, y) with 1 ≤ x ≤ y ≤ n and x + y = n, returning them sorted by x. With n ≤ 10^6 this is typically done by precomputing primes up to n (e.g., sieve) and checking complements for x in [2, n/2].
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 2761. Prime Pairs With Target Sum
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source