Q2: Solve the following problem:

The following source code returns the longest substring that appears at both the beginning and end of the string without overlapping.

For example: sameEnds("abXab") returns "ab".

01	public String sameEnds(String string) {

02	int len = string.length();

03	String fin = "";

04	String tmp = "";

05

06	for (int i = 0; i < len; i++) {

07	tmp += string.charAt(i);

08	int tmplen = tmp.length();

09	if (i < len / 2 && tmp.equals(string.substring(len-tmplen,len)))

10	fin = tmp;

11

}

12	return fin;

13

}