lab1. Radix sort
lab2. Red Black tree
lab4. Knuth Morris Pratt algorithm
Lab5. Ukkonen's algorithm
lab6. Big Integer c++ realization
lab7. Count Palindromic Subsequences using dynamic programming
lab8. Find minimum number of segments that would completely cover the interval using greedy algorithm
lab9. Searching for connected components in an undirected graph
Course Project. LZ78