214.Shortest Palindrome || Leetcode || Solved&Explained || C++

Рет қаралды 9,381

Aanchal Jain

Күн бұрын

Пікірлер: 35

@avneedadhich9185 Жыл бұрын

My search for it's solution finally came to an end . Thanks for such a great explanation .

@shikharai-tl4vb 3 ай бұрын

you tried well Understanding a problem and effectively explaining it to others are two entirely different skills.

@abhishekverma7604 Жыл бұрын

thanks for the algorithm,since code part is way too easy and self implementable...

@aanchaljain4610 Жыл бұрын

Glad it helped!

@materialscience8301 Жыл бұрын

thanks for make it. your explanation is very well 😊😊 i hope you will continue ..& grow

@aanchaljain4610 Жыл бұрын

sure!thank you

@ujwalchawla6721 10 ай бұрын

keep going🤘

@VishalYadav-gk1kg Жыл бұрын

Very Nice Explanation Mam, Thank you !

@AdityaKumar-be7hx Жыл бұрын

Great explanation! Only tip is we can reuse the "t" variable instead of creating a new shorter string. return t.substr(0, s.size()-i)+s;

@aanchaljain4610 Жыл бұрын

Thank you

@ss8273 Жыл бұрын

thanks sister explained very well🙌🙌

@aanchaljain4610 Жыл бұрын

Thank you

@ArnabBhadra02 3 ай бұрын

Is it possible to solve Using longest common substring between s and rev(s) and after that return the total length -s

@Rahul-kw6zf 7 ай бұрын

Finally After 2 days got h pretty good solution!! Understood❤

@eklavyacodinghub 3 ай бұрын

thanks ma'am for making this concept so easy

@srikarsaini 3 ай бұрын

10:06 Here we should not increment "j". There is a mistake in explanation. Check the code we are not incrementing "j" there in else statement. we are only changing the pointer "i".

@PankajKumar-pk9dm 10 ай бұрын

loved the approach and awesome explanation

@unclezee7369 4 ай бұрын

Best explanation so far

@hackingkingdom5634 Жыл бұрын

Nice approach Helpful✋

@aanchaljain4610 Жыл бұрын

Glad it was helpful!

@satyamaditya384 5 ай бұрын

Thank you ma'am for such a great explanation, I had been struggling with KMP too, but now concepts are crystal clear. Thanks a lot!!!

@silent-st1no 7 ай бұрын

very very good explanation, thank you so much you are the great❤

@aanchaljain4610 6 ай бұрын

Thanks ❤

@priyanshupriyam174 5 ай бұрын

Thanks a lot ma'am, cleared my kmp concepts well.

@shh442 5 ай бұрын

class Solution: def shortestPalindrome(self, s: str) -> str: if s == s[::-1]: return s n = len(s) # Loop to find the largest palindrome prefix for i in range(n, 0, -1): if s[:i] == s[:i][::-1]: break # Add the reverse of the suffix to the start of the string suffix = s[i:] return suffix[::-1] + s