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 3

Time Complexity

Open reading material (PDF)

Tasks:

easy

FrogJmp

VIEW START
Count minimal number of jumps from position X to Y.
easy

PermMissingElem

VIEW START
Find the missing element in a given permutation.
easy

TapeEquilibrium

VIEW START
Minimize the value |(A[0] + ... + A[P-1]) - (A[P] + ... + A[N-1])|.