Variant of solving "Longest Common Substring Problem"

The longest common substring problem is to find the longest string (or strings) that is a substring (or are substrings) of two or more strings. It should not be confused with the longest common subsequence problem. (For an explanation of the difference between a substring and a subsequence, see Substring vs. subsequence).

Simplification:

Constructs longest string as a substring of input string consisting of no more than two different characters.

This project is a library. Use cargo options as tests, examples and benches to explore how it works. Have fun.

Additional information

• Best Algorithms and Data Structures Books
• Recommended Links

Rust information

• rustc 1.32.0-nightly