We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I've implemented this in Haskell exactly as the wikipedia article specified, but I'm timing out on the last 3 test cases.
I've had a similar experience with using haskell on hackerrank with other problems, where I feel like I've implemented it in the most efficient way, while also tacking on seemingly extraneous optimizations that seem above and beyond the scope of the problem in a lot of cases, and it still ends up timing out on the larger test cases.
If anyone has any insight on why this might be happening I'd greatly appreciate it.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Substring Searching
You are viewing a single comment's thread. Return to all comments →
I've implemented this in Haskell exactly as the wikipedia article specified, but I'm timing out on the last 3 test cases.
I've had a similar experience with using haskell on hackerrank with other problems, where I feel like I've implemented it in the most efficient way, while also tacking on seemingly extraneous optimizations that seem above and beyond the scope of the problem in a lot of cases, and it still ends up timing out on the larger test cases.
If anyone has any insight on why this might be happening I'd greatly appreciate it.