Code Room
CodingMedium
Question
Return the nth prime number, 1-indexed (so the 1st prime is 2, the 6th is 13). Assume 1 <= n <= 10000. You do not know the value of the nth prime in advance, so you must size your sieve adaptively or grow it until you have collected enough primes.
Implement
nth_prime(n: int) → intExamples
in
[6]out13What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.