1
00:00:00,170 --> 00:00:04,160
Let's do this question called longest palindromic substring.

2
00:00:04,160 --> 00:00:05,540
The question reads.

3
00:00:05,540 --> 00:00:14,060
Given a string S, return the longest palindromic substring in S, you will not be given an empty string,

4
00:00:14,060 --> 00:00:15,800
and we're given an example.

5
00:00:15,800 --> 00:00:22,910
If the string which is given to us is p a p a d, then the answer could be either p a p.

6
00:00:23,480 --> 00:00:28,850
Okay, so that's this over here, or it can be a p a, which is this part over here.

7
00:00:28,940 --> 00:00:32,510
Because notice both of these are of length three.

8
00:00:32,510 --> 00:00:38,870
And again we cannot form any palindromic substring from this string over here which has a length greater

9
00:00:38,870 --> 00:00:39,500
than three.

10
00:00:39,500 --> 00:00:41,720
So this is the question at hand okay.

11
00:00:41,720 --> 00:00:47,090
So we have to identify the longest palindromic substring in the string which is given to us.

12
00:00:47,090 --> 00:00:54,920
Now let's see in the next video how we can solve this question by just making a minor modification to

13
00:00:54,920 --> 00:00:58,670
the palindromic substring question, which we have previously discussed.