This contains papers, notes and solutions based on and provided from Codility for Programmers.
These resources might be useful as a preparation:
- Mathematical recipes (for programmers)
- Big-O Notation Explained: Definition & Examples (Part 1)
- Big-O Notation Explained for Not-So-Technical People (Part 2)
- Big-O Notation Explained: The Curse of CC All (Part 3)
The lessons can be found here.
There are some code samples based on the lesson papers. These sources can be executed using node:
node src/lesson-001-iterations/l001-iterations.study.js- Lesson 1 - Iterations notes
- Lesson 2 - Arrays notes
- Lesson 3 - Time Complexity notes
- Lesson 4 - Counting Elements notes
- Lesson 5 - Prefix Sums notes
- Lesson 6 - Sorting notes
- Lesson 7 - Stacks and Queues notes
- Lesson 8 - Leader notes
- Lesson 9 - Maximum Slice Problem notes
- Lesson 10 - Prime and Composite Numbers notes
- Lesson 11 - Sieve of Eratosthenes notes
- Lesson 12 - Euclidean Algorithm notes
- Lesson 13 - Fibonacci Numbers notes
- Lesson 14 - Binary Search Algorith notes
- Lesson 15 - Caterillar Method notes
- Lesson 16 - Greedy Algorithms notes
- Lesson 17 - Dynamic Programming notes
- Lesson 90 - Tasks from Indeed Prime 2015 challenge notes
- Lesson 91 - Tasks from Indeed Prime 2016 challenge notes
- Lesson 92 - Tasks from Indeed Prime 2016 College Coders challenge notes
- Lesson 99 - Future Training notes