Abstract
The discussion of interesting tasks from the Czech national olympiad in informatics. This is a task focused on finding repeated segments in a sequence of numbers.
An important criterion for the solution is to improve the space and time complexity of the algorithm chosen. The article discusses the problem and several possible solutions in the form of a computer program.