NeetCode #936LC-204MediumMath & Geometry
← Back to All Problems

#936 · #204 · Count Primes(计数质数)

📌 Problem Statement & Constraints

Given an integer n, return the number of prime numbers strictly less than n. Constraints: 0 <= n <= 5 * 10^6.
🔒

Sign In to Unlock Full Solutions for All 973 Problems

Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!