Skip to Content
PracticeProblems.org

Coding Interviews: Math

Collapse
All Coding InterviewsSimple Data StructuresSearching and SortingArrays and StringsStacks and QueuesGreedy AlgorithmsDynamic ProgrammingGraphsComplex Data StructuresMathMiscellaneousSystem Design
Count prime numbers - Sieve of Eratosthenes

Given an integer n, return the number of prime numbers that are strictly less than n.

MathMediumVideoPythonCode Solution