Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.
AVAILABLE LESSONS:
Lesson 1
Iterations
Lesson 2
Arrays
Lesson 3
Time Complexity
Lesson 4
Counting Elements
Lesson 5
Prefix Sums
Lesson 6
Sorting
Lesson 7
Stacks and Queues
Lesson 8
Leader
Lesson 9
Maximum slice problem
Lesson 10
Prime and composite numbers
Lesson 11
Sieve of Eratosthenes
Lesson 12
Euclidean algorithm
Lesson 13
Fibonacci numbers
Lesson 14
Binary search algorithm
Lesson 15
Caterpillar method
Lesson 16
Greedy algorithms
Lesson 17
Dynamic programming
Lesson 99
Future training
Lesson 10

Prime and composite numbers

Open reading material (PDF)

Tasks:

easy

CountFactors

VIEW START
Count factors of given number n.
easy

MinPerimeterRectangle

VIEW START
Find the minimal perimeter of any rectangle whose area equals N.
medium

Flags

VIEW START
Find the maximum number of flags that can be set on mountain peaks.
medium

Peaks

VIEW START
Divide an array into the maximum number of same-sized blocks, each of which should contain an index P such that A[P - 1] < A[P] > A[P + 1].