w3resource
Java Programming Exercies

Java String Exercises: Find the longest substring appears at both ends of a given string

Java String: Exercise-93 with Solution

Write a Java program to find the longest substring appears at both ends of a given string.

Sample Solution:

Java Code:

import java.util.*;
public class Main
{
public String appearInBothEnds(String stng) 
{
  int l = stng.length();
  String f_str = "";
  String tmp = "";
  for (int i = 0; i < l; i++) 
  {
    tmp += stng.charAt(i);
    int t_len = tmp.length();
    if (i < l / 2 && tmp.equals(stng.substring(l-t_len,l)))
      f_str = tmp;
  }
  return f_str;
}

public static void main (String[] args)
    {
      Main m= new Main();
      String str1 =  "playersplay";
      System.out.println("The given string is: "+str1);
      System.out.println("The longest substring in the string is: "+m.appearInBothEnds(str1));
	  }
}

Sample Output:

The given string is: playersplay
The longest substring in the string is: play

Flowchart:

Flowchart: Java String Exercises - Find the longest substring appears at both ends of a given string

Java Code Editor:

s

Improve this sample solution and post your code through Disqus

Previous: Write a Java program to return a substring after removing the all instances of remove string as given from the given main string.
Next: Write a Java program to find the longest mirror image string at the both ends of a given string.

What is the difficulty level of this exercise?



New Content: Composer: Dependency manager for PHP, R Programming