Suffix arrays - a programming contest approach

An important algorithmic area often used in practical tasks is that of algorithms on character strings. Many programming contests have used problems that could have been easily solved if one efficiently managed to determine if one string was a subsequence of another string, or had found an order relation within a string’s suffixes. We shall present a versatile structure that allows this along with other useful operations on a given string.