Write a function (method) and unit tests for the following task: Given a string, return the longest substring that appears at both the beginning and end of the string without overlapping. For example, sameEnds("abXab") is "ab". sameEnds("abXYab") → "ab" sameEnds("xx") → "x" sameEnds("xxx") → "x"
-
Notifications
You must be signed in to change notification settings - Fork 0
Santiors/Test_task
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published