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 4

Counting Elements

Open reading material (PDF)

Tasks:

easy

FrogRiverOne

VIEW START
Find the earliest time when a frog can jump to the other side of a river.
easy

PermCheck

VIEW START
Check whether array A is a permutation.
medium

MaxCounters

VIEW START
Calculate the values of counters after applying all alternating operations: increase counter by 1; set value of all counters to current maximum.
medium

MissingInteger

VIEW START
Find the smallest positive integer that does not occur in a given sequence.