Problem
Twin primes are two primes that differ by 2, such as 11 and 13 or 17 and 19. Find every such pair whose larger member is at most limit.
Implement twin_primes(limit).
For large limits, find all primes at once with a sieve instead of testing each number separately.
Input
limit: The largest value the larger prime of a pair may have.
Output
Return a list of pairs [p, p + 2] where both numbers are prime and p + 2 ≤ limit, sorted by p in ascending order. If there are none, return an empty list.
Constraints
0 ≤ limit ≤ 10^6
Examples
Input:
limit = 20
Expected output:
expected = [
[3, 5],
[5, 7],
[11, 13],
[17, 19]
]
Input:
long long limit = 20;
Expected output:
std::vector<std::vector<long long>> expected = {
{3, 5},
{5, 7},
{11, 13},
{17, 19}
};
Input:
long limit = 20;
Expected output:
long[][] expected = new long[][] {
new long[] {3, 5},
new long[] {5, 7},
new long[] {11, 13},
new long[] {17, 19}
};
Explanation
The primes up to 20 are 2, 3, 5, 7, 11, 13, 17, 19; the ones 2 apart give [[3, 5], [5, 7], [11, 13], [17, 19]].
Input:
limit = 6
Expected output:
expected = [
[3, 5]
]
Input:
long long limit = 6;
Expected output:
std::vector<std::vector<long long>> expected = {
{3, 5}
};
Input:
long limit = 6;
Expected output:
long[][] expected = new long[][] {
new long[] {3, 5}
};
Explanation
3 and 5 are both prime and 5 ≤ 6, but 7 is above the limit, so only [[3, 5]].
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
A sieve finds all primes up to 10^6 much faster than testing each number.
Hint 2
Then check every p with p + 2 ≤ limit.
Hint 3
The first pair is (3, 5), so any limit below 5 gives an empty list.
Expected complexity
O(limit log log limit) time, O(limit) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.