Maximal Boundaries—Knuth–Morris–Pratt

edualgo / interview-corner

Many time, when an interview approaches, candidates start searching for different algorithms in different programming languages for practise. This project aims to build a website which will contain the codes along with the techniques and explanations so that it can be helpful for many

https://opensource.edualgoacademy.com/interview-corner/

MIT License

42 stars 41 forks source link

Maximal Boundaries—Knuth–Morris–Pratt #61

Open Rahul555-droid opened 3 years ago

Rahul555-droid commented 3 years ago

Input: abracadabra Output: abra abra

An important classic problem on character strings is the detection of occurrences of a pattern t in a string s. The Knuth–Morris–Pratt algorithm solves this problem in optimal linear time O(|t| + |s|)

I would want to work on this issue for SWOC and would want to implement this in python.

Rahul555-droid commented 3 years ago

I would want to work on this issue for SWOC and would want to implement this in python.

Please assign me this!!

Abhijit2505 commented 3 years ago

@Rahul555-droid please get started

Rahul555-droid commented 3 years ago

Okay thanks! will do.