Let's do this question called longest palindromic substring.
The question reads.
Given a string S, return the longest palindromic substring in S, you will not be given an empty string,
and we're given an example.
If the string which is given to us is p a p a d, then the answer could be either p a p.
Okay, so that's this over here, or it can be a p a, which is this part over here.
Because notice both of these are of length three.
And again we cannot form any palindromic substring from this string over here which has a length greater
than three.
So this is the question at hand okay.
So we have to identify the longest palindromic substring in the string which is given to us.
Now let's see in the next video how we can solve this question by just making a minor modification to
the palindromic substring question, which we have previously discussed.