Skip to main content
← CoursesInterview PrepModule 3 · Trees, Graphs, BFS/DFSMath: prime sieve + Euclidean GCDwrite42 / 100
💬 Discuss🧪 Playground+100 XP
Task
📝 **Task:** Write `count_primes(n)` returning the number of primes strictly less than n. Print `count_primes(30)`. Expected: 10 📋 Edit the starter code. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.

Keep going

✏️ Write your code here
🐍
Loading Python...
First visit only — ~5-10s. Stays cached afterward.
📊 Result
Press Run to see result...
📣 Help someone learn PythonShare this lesson with a friend — the first 15 are free, no signup.Tweet

💬 Discussion

Be the first to ask a question or share a tip.
Sign in to join the discussion. Reading is free.
Loading discussion…