CodingHardcod-g642

Subject PrimesLevel Senior–Staff~35 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Determine whether a 64-bit integer n is prime using deterministic Miller-Rabin (a fixed set of bases suffices for n < 2^64). Return True/False. Constraints: 0 <= n < 2^63. Handle 0, 1, and small primes correctly. Trial division alone would be far too slow for n near 10^18.

Implement

is_prime(n: int) → bool

Examples

in[561]outfalse

What 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.