- [Stack with Linked Nodes] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Stack-with-LinkedNodes)
- [Queue with Linked Nodes] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Queue-with-LinkedNodes)
- [Dynamic Array with Proxy] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Dynamic-Array-with-Proxy)
- [Linked List] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/LinkedList)
- [Binary Search Tree - BST] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/(BST)Binary-Search-Tree)
- [Min Binary Heap] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Min-Binary-Heap)
- [Trie (prefix tree)] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Trie%20(prefix%20tree))
- [Tree] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Tree)
- [Homework 1] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-1) - using Stack and some kind of a decompression(2B -> BB and etc).
- [Homework 2] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-2) - using Queue, LinkedList, BFS and DFS. Find all available paths from one point to all others in matrix.
- [Homework 3] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-3) - using Trie, Vector and merge sort alphabetically.
- [Homework 4] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-4)
- [Homework 5] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Homework-5)
- [RPN] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/RPN) - Reverse Polish notation
- [Braces] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/Data-structures-Algorithms-course/Braces)
- [Homework 1] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Cars%2C%20files%2C%20Homework%201)
- [Homework 2] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Jar%20with%20Cookies%2C%20Homework%202)
- [Homework 3] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Vectors%2C%20Homework%203)
- [Homework 4] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Homework%204)
- [Homework 5] (https://github.com/pepincho/C-plus-plus-Courses-FMI/tree/master/OOP-course/Homework%205)
- Homework 1
- Homework 2
- Homework 3
- Homework 4
- Homework 5