Leetcode 2738. Count Occurrences in Text

Given a long text and one or more query strings, count how many times each query appears in the text (including overlapping matches). The core challenge is efficient multiple-pattern substring matching on large input, typically solved with KMP for single patterns or a trie/automaton like Aho–Corasick for many patterns.