Skip to main content
Count Primes | AlgoCracked
AlgoCracked
ProblemsCount Primes
Medium33.0% acceptance
ArrayMathEnumerationNumber Theory

Count Primes

Given an integer n , return the number of prime numbers that are strictly less than n . Input format Input is [n] , e.g. [10] .

Loading workspace…