Question

Write a function to find out longest palindrome in a given string?.

ᏦᎨᏁᎠᏝᎽ ɴᴏ sᴘᴀᴍ​

Answer 1

Answer:

The simple approach is to check each substring whether the substring is a palindrome or not. To do this first, run three nested loops, the outer two loops pick all substrings one by one by fixing the corner characters, the inner loop checks whether the picked substring is palindrome or not.

thank you for giving me thanks

Answer 2

Explanation:

// A Java solution for longest palindrome

import java.util.*;

class GFG{

// Function to print a subString str[low..high]

static void printSubStr(String str, int low, int high)

{

for (int i = low; i <= high; ++i)

System.out.print(str.charAt(i));

}

// This function prints the

// longest palindrome subString

// It also returns the length

// of the longest palindrome

static int longestPalSubstr(String str)

{

// get length of input String

int n = str.length();

// All subStrings of length 1

// are palindromes

int maxLength = 1, start = 0;

// Nested loop to mark start and end index

for (int i = 0; i < str.length(); i++) {

for (int j = i; j < str.length(); j++) {

int flag = 1;

for (int k = 0; k < (j - i + 1) / 2; k++)

if (str.charAt(i + k) != str.charAt(j - k))

flag = 0;

if (flag!=0 && (j - i + 1) > maxLength) {

start = i;

maxLength = j - i + 1;

}

}

}

System.out.print("Longest palindrome subString is: ");

printSubStr(str, start, start + maxLength - 1);

return maxLength;

}

public static void main(String[] args)

{

String str = "forgeeksskeegfor";

System.out.print("\nLength is: "

+ longestPalSubstr(str));

}

}

Output:

Longest palindrome subString is: geeksskeeg Length is: 10