**Logic:** Prime if no divisor in [2, √n]. **Code:** `for i in range(2, int(n**0.5)+1): if n%i==0: return False`. O(√n). **Optimize:** Check 2, then odds. **Large n:** Miller-Rabin probabilistic. **Why:** Validation, sampling....
Pro-Move: Miller-Rabin for large n. Red Flag: Trial division for 10^18.
This easy-level Python/Coding question appears frequently in data engineering interviews at companies like HashedIn. While less common, it tests deeper understanding that distinguishes strong candidates.
Start by clearly defining the core concept being asked about. Interviewers want to see that you understand the fundamentals before diving into implementation details. Structure your answer with a definition, then explain the practical application with a concise example.
Logic: Prime if no divisor in [2, √n]. Code: for i in range(2, int(n0.5)+1): if n%i==0: return False. O(√n). Optimize: Check 2, then odds. Large n: Miller-Rabin probabilistic. Why: Validation, sampling. Production:** Use for bounded ranges; library for big numbers.
Want feedback on your answer?
Paste your answer to this question and our AI Coach scores it, finds gaps, and shows you the FAANG-level version.
Paste your answer and get instant AI feedback with a FAANG-level improved version.
Analyze My Answer — FreeAccording to DataEngPrep.tech, this is one of the most frequently asked Python/Coding interview questions, reported at 1 company. DataEngPrep.tech maintains a curated database of 1,863+ real data engineering interview questions across 7 categories, verified by industry professionals.