forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice


String-3 > sameEnds
prev  |  next  |  chance

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"

...Save, Compile, Run (ctrl-enter)

public String sameEnds(String string) { }

Editor font size %:
Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

Misc Code Practice

Difficulty: 321.0

Copyright Nick Parlante 2017 - privacy