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.

सीमाएँ

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

उदाहरण

इनपुट:
text = "bananas"
patterns = ["ana", "apple", "nas"]

अपेक्षित आउटपुट:
expected = ["YES", "NO", "YES"]

इनपुट:
std::string text = "bananas";
std::vector<std::string> patterns = {"ana", "apple", "nas"};

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"YES", "NO", "YES"};

इनपुट:
string text = "bananas";
string[] patterns = new string[] {"ana", "apple", "nas"};

अपेक्षित आउटपुट:
string[] expected = new string[] {"YES", "NO", "YES"};

इनपुट:
text = "aaaa"
patterns = ["aa", "aaaaa", "aa"]

अपेक्षित आउटपुट:
expected = ["YES", "NO", "YES"]

इनपुट:
std::string text = "aaaa";
std::vector<std::string> patterns = {"aa", "aaaaa", "aa"};

अपेक्षित आउटपुट:
std::vector<std::string> expected = {"YES", "NO", "YES"};

इनपुट:
string text = "aaaa";
string[] patterns = new string[] {"aa", "aaaaa", "aa"};

अपेक्षित आउटपुट:
string[] expected = new string[] {"YES", "NO", "YES"};

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

• CSES: Finding Patterns