René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[OTHER]","articleBody":"### What would you like to share?\n\n### What would you like to Propose?\n\nAdd an implementation of the Aho-Corasick string matching algorithm.\n\nProblem statement: Given a text and a list of patterns, find all occurrences of all patterns in the text efficiently. This algorithm is useful when multiple keywords need to be searched in a single pass.\n\n### Issue details\n\nThe implementation can be added under the string/search-related package and should include unit tests.\n\nExpected behavior examples:\n\nInput:\n- text: `ahishers`\n- patterns: `[\"he\", \"she\", \"his\", \"hers\"]`\n\nExpected matches:\n- `his` at index `1`\n- `she` at index `3`\n- `he` at index `4`\n- `hers` at index `4`\n\nSuggested implementation details:\n- Build a trie from all patterns.\n- Compute failure links using BFS.\n- Traverse the input text once and report matched patterns.\n- Expected time complexity: `O(n + m + z)`, where `n` is the text length, `m` is the total length of all patterns, and `z` is the number of matches.\n- Expected space complexity: `O(m)`.\n\n### Additional Information\n\nThis would be a useful addition for educational coverage of multi-pattern string matching algorithms.\n\n### Additional information\n\n_No response_","author":{"url":"https://github.com/wdlpazlmj","@type":"Person","name":"wdlpazlmj"},"datePublished":"2026-06-01T03:37:37.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":3},"url":"https://github.com/7442/Java/issues/7442"}