KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I need to find the longest sequence in a string with the caveat that the sequence must be repeated three or more times. So, for example, if my string is: fdwaw4helloworldvcdv1c3xcv3xcz1sda21f2sd1ahelloworldgafgfa4564534321fadghelloworld then I would like the value " helloworld " to be returned. I know of a few ways of accomplishing this but the problem I'm facing is that the actual string is absurdly large so I'm really looking for a method that can do it in a timely fashion.
Tags (comma-separated)
Save Edits
Cancel