Daily Coding Problem: Problem #276 [Hard]

[cwetanow]

Good morning! Here's your coding interview problem for today.

This problem was asked by Dropbox.

Implement an efficient string matching algorithm.

That is, given a string of length N and a pattern of length k, write a program that searches for the pattern in the string with less than O(N * k) worst-case time complexity.

If the pattern is found, return the start index of its location. If not, return False.

---

Ready to interview? Apply to top tech companies and startups in seconds through Talentvine, our exclusive candidate network [https://www.talentvine.io/?ref=dailycodingproblem]!

---

Upgrade to premium [https://www.dailycodingproblem.com/subscribe?email=mladenovv.ivan%40gmail.com] and get in-depth solutions to every problem, including this one.

If you liked this problem, feel free to forward it along so they can subscribe here [https://www.dailycodingproblem.com/]! As always, shoot us an email if there's anything we can help with!

---

No more? Unsubscribe [https://dailycodingproblem.com/unsubscribe?unsubscribeKey=8fbf5e4231ed1f420d6c2d883ded85dee1df0cdbb4be9a5b5a3501c89063afd9b3d8529e] .