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 90
Tasks from Indeed Prime 2015 challenge
Lesson 91
Tasks from Indeed Prime 2016 challenge
Lesson 92
Tasks from Indeed Prime 2016 College Coders challenge
Lesson 99
Future training
Lesson 6

Sorting

Open reading material (PDF)

Tasks:

painless

MaxProductOfThree

VIEW START
Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).
painless

Distinct

VIEW START
Compute number of distinct values in an array.
painless

Triangle

VIEW START
Determine whether a triangle can be built from a given set of edges.
respectable

NumberOfDiscIntersections

VIEW START
Compute the number of intersections in a sequence of discs.