Algorithms and Data Structures course tasks

Description

Here are presented most competitive problems I've completed within Algorithms and Data Structures course of Faculty of Applied Mathematics and Informatics, Belarusian State University.

Contents

Repository contains seven problems that covers main topics of Algorithms and Data Structures study. Here are problem names and topics covered:

1. Almost strictly increasing sequence — Dynamic programming, recurrence equations
2. BST semipath — BST
3. Park — Dynamic programming, recurrence equations, data structures
4. Segment tree — Data structures
5. String roll — Dynamic programming, recurrence equations
6. Words — Graphs, Eulerian path
7. Segments — Graphs, Hungarian algorithm

How to use

Solutions are presented as C++ (.cpp) and C# (.cs) source code files. Solutions use file input/output.

Todo

• Solutions testing
• Detailed algorithm description and further reading for each problem