Longest Palindromic substring in a given String using C++

By Shaik Jafar

When the user inputs any string, it gives the longest palindromic substring of the given string( case sensitive ) efficiently using C++ programming language.

In this project, an input string is given by the user and can get the Longest Palindromic substring in the given string using C++ programming language. The result will be case-sensitive.

The operation will be done in a much efficient way that the user can get the result by just traversing through the string ( O( Length of string ) ).Thus, the user can be able to give the string of larger lengths.

If the given string is empty, it will give the empty string itself.

Note: The input string can also contains spaces(' ').

The user can interact as follows: