Algorithm request: Aho-Corasick

The task. The input receives several lines pattern [i] and line s. Our task is to find all possible occurrences of pattern [i] strings in s.

The issue requests implementing the Aho-Corasick string matching algorithm. Look at existing algorithm implementations in the repository for structure and style. Start by understanding the algorithm's theory, then design a class that can take multiple patterns and search a string. Check for any test files related to string searching to see the expected interface and add tests for the new implementation.

Do mô hình lập chỉ mục viết ra từ nội dung của issue.