Find Many Patterns in Text

For each requested pattern, decide whether it appears as a contiguous substring anywhere in the shared text. Patterns may overlap and may repeat. Return results in the original query order. The limits require an approach that can handle many patterns efficiently.

Implement find_many_patterns(text, patterns).

Input

text: The text searched by every query.

patterns: The patterns, in query order.

Output

Return YES for each occurring pattern and NO for each absent one.

Restricciones

1…100,000 text characters. 1…100,000 nonempty patterns, with total length at most 500,000. All characters are lowercase a–z.

Ejemplos

Entrada:
text = "bananas"
patterns = ["ana", "apple", "nas"]

Salida esperada:
expected = ["YES", "NO", "YES"]

Entrada:
std::string text = "bananas";
std::vector<std::string> patterns = {"ana", "apple", "nas"};

Salida esperada:
std::vector<std::string> expected = {"YES", "NO", "YES"};

Entrada:
string text = "bananas";
string[] patterns = new string[] {"ana", "apple", "nas"};

Salida esperada:
string[] expected = new string[] {"YES", "NO", "YES"};

Entrada:
text = "aaaa"
patterns = ["aa", "aaaaa", "aa"]

Salida esperada:
expected = ["YES", "NO", "YES"]

Entrada:
std::string text = "aaaa";
std::vector<std::string> patterns = {"aa", "aaaaa", "aa"};

Salida esperada:
std::vector<std::string> expected = {"YES", "NO", "YES"};

Entrada:
string text = "aaaa";
string[] patterns = new string[] {"aa", "aaaaa", "aa"};

Salida esperada:
string[] expected = new string[] {"YES", "NO", "YES"};

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• CSES: Finding Patterns