11. Sieve of Eratosthenes lesson - Learn to Code - Codility

Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

AVAILABLE LESSONS:

Time Complexity

Counting Elements

Stacks and Queues

Maximum slice problem

Prime and composite numbers

Sieve of Eratosthenes

Euclidean algorithm

Fibonacci numbers

Binary search algorithm

Caterpillar method

Greedy algorithms

Dynamic programming

Tasks from Indeed Prime 2015 challenge

Tasks from Indeed Prime 2016 challenge

Tasks from Indeed Prime 2016 College Coders challenge

Future training

Open reading material (PDF)

Tasks:

painless

CountSemiprimes

VIEW START

Count the semiprime numbers in the given range [a..b]

respectable

CountNonDivisible

VIEW START

Calculate the number of elements of an array that are not divisors of each element.