---
title: "Discussion on \"Aho-Corasick\" | Hashnode"
description: "Discussion on \"Aho-Corasick\". Find all occurrences of a finite set of strings in a given search string in linear time!\nPhoto by Priscilla Du Preez on Unsplash\nThe Aho-Corasick algorithms allows you to find any amount of substrings and their position in a given search string. It d..."
url: "https://hashnode.com/posts/aho-corasick-explained/617d319975401e57d6a888f5"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Aho-Corasick](https://blog.oscarablinger.dev/aho-corasick-explained?utm_source=hashnode&utm_medium=feed)

Find all occurrences of a finite set of strings in a given search string in linear time! Photo by Priscilla Du Preez on Unsplash The Aho-Corasick algorithms allows you to find any amount of substrings and their position in a given search string. It d...

Jul 13, 2021 · 5 min read · blog.oscarablinger.dev  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#programmer](https://hashnode.com/tag/programmer)
-   [#programming](https://hashnode.com/tag/programming)
-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)

## Written by

[Oscar Ablinger](https://hashnode.com/@OscarAblinger)

@OscarAblinger

  
[View profile](https://hashnode.com/@OscarAblinger)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.