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

Solved a problem from leetcode.
Problem Name:Shortest Palindrome
Level:Hard
Link to the problem: leetcode.com/p...
Recommended: Watch it on 1.75x or 2x.

[@shikharai-tl4vb]

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

[@eklavyacodinghub]

thanks ma'am for making this concept so easy

[@unclezee7369]

Best explanation so far

[@avneedadhich9185]

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

[@anonymoustrolls7952]

she just taught KMP, good explanation

[@soumya_suman]

Thank You !!!

[@satyamaditya384]

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!!!

[@materialscience8301]

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

[@aanchaljain4610]

sure!thank you

[@abhishekverma7604]

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

[@aanchaljain4610]

Glad it helped!

[@Rahul-kw6zf]

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

[@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

[@ArnabBhadra02]

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

[@VishalYadav-gk1kg]

Very Nice Explanation Mam, Thank you !

[@silent-st1no]

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

[@aanchaljain4610]

Thanks ❤

[@shh442]

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

[@srikarsaini]

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".

[@path8799]

Understood💯❤

[@Yourcodehelper]

todays daily problem

[@ss8273]

thanks sister explained very well🙌🙌

[@aanchaljain4610]

Thank you

[@PankajKumar-pk9dm]

loved the approach and awesome explanation

[@priyanshupriyam174]

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

[@machans-203]

But it doesn't pass all test cases.. for string "aabba" the ans is "abbaabba" how is it possible
And also, "abb" -> ans: "bbabb"

[@harmankour1711]

because given is we are allowed to add in the front only
and it is passing all the test case just check your code again

[@hhcdghjjgsdrt235]

You got one subscriber

[@naive-fleek7420]

you are soo smart

[@ujwalchawla6721]

keep going🤘

[@hackingkingdom5634]

Nice approach Helpful✋

[@aanchaljain4610]

Glad it was helpful!

[@raviroy84]

Clear explaination❤