This repo contains lecture materials that I used while teaching algorithms club at Ukrainian Catholic University. It is oriented towards freshmen students, who are not familiar with competitive programming and C++ programming language.
Lectures are mostly in english and so are the problem statements.
Hovewer, there are some some tasks available only in russian/ukrainian. Unfortunately, the main reference web-site, e-maxx.ru is written in russian, but there are some unofficial translation web-sites like cp-algorithms.com. You can try reading the references there.
1. C++ introduction, implementation tasks (01.11.19)
2. C++ introduction (cont.), implementation tasks (08.11.19)
3. C++ introduction (cont.), problem session (11.11.19)
4. Numbers Theory, Recursion (22.11.19)
5. Bitwise Operations, Merge Sort, Divide and Conquer (29.11.19)
6. Graph Theory (05.12.19)
7. Graph Theory (cont.) (12.12.19)
8. Binary Search, Dynamic Programming (20.12.19)
9. SQRT Decomposition, Mo's Algorithm, Segment Tree (27.12.19)
Main platforms:
- e-olymp - good for starters
- codeforces - my main platform (you can see the solutions of other people and read editorials of all of the problems, follow me :))
- algotester - online judge created by Lviv National University guys
Other resources:
- spoj
- codechef
- csacademy
- atcoder
- timus - hardcore
- leetcode - more suitable for preparing for the interview
- e-maxx - collection of the algorithms used in competitive programming with derivations and code pieces. Preferred reference web-site for any algorithm, covered on the lectures. There are English and Russian versions.
- C++ implementation tasks from lecture 1 can be found on vjudge. Password:
47 - C++ containers practice from lecture 2 can be found on vjudge. Password:
47 - C++ containres practice from Uzhgorod Programming Summer School 2019 can be found here: pdf
- Numbers Theory tasks from lecture 4 can be found on vjudge. Password:
47 - Merge Sort, Divide and Conquer, Bits Manipulation tasks from lecture 5 can be found on vjudge. Password:
47 - Graph Theory problems from lecture 6:
- Graph Theory problems from lecture 7:
- Binary Search problems from lecture 8:
- Dynamic Programming problems from lecture 8:
- Segment Tree problems from lecture 9:
