Given an integer n, return the count of prime numbers strictly less than n.
Input: n=10 Output: 4 (2,3,5,7) Input: n=0 Output: 0
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features