6. Sorting lesson - Learn to Code

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

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Binary search algorithm

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

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.

Sorting

Tasks:

MaxProductOfThree

Distinct

Triangle

NumberOfDiscIntersections

For programmers

For companies

Contact us:

Sorting

Tasks:

MaxProductOfThree

Distinct

Triangle

NumberOfDiscIntersections

For programmers

For companies

Sign up for our newsletter:

Social:

Contact us: