Very helpful with the diagrams and example run through the code - thank you!

thank u so much

Great and simple explanation! I liked the video!

i have little bit confuse and please explain better way

great

This is the smartest way to explain and visualize this hard problem. We miss you, buddy. Why did you stop? Thank you so much.😍

Great Explanation. Thanks for the video.

Great animation, this is perfect

YES! you deserve, i was searching for this problem for 3 hours and finally found it Good work keep it up

finally got this algo thanks a lot

Great job

Great job. Wondered how this was done recursively, I could only find iterative approaches using maxheap. Very nice solution!

Was really struggling to the point I was gonna skip this algorithm. You helped me understand it, thank you so much for your help! This is way better than some videos with more views.

string shortestPalindrome(string s) { string ans=s; reverse(ans.begin(),ans.end()); ans=s+'#'+ans; vector<int>lps(ans.size()+2,0); int i=1; int len=0; while(i<ans.size()){ if(ans[i]==ans[len]){ len++; lps[i]=len; i++; } else{ if(len!=0)len=lps[len-1]; else i++; } } if(lps[ans.size()-1]<s.size()){ string m = s.substr(lps[ans.size()-1],ans.size()-lps[ans.size()-1]); reverse(m.begin(),m.end()); return m+s; } return s; }

why r u not making more videosssss???????????

My Answer in Python class Node: def __init__(self,key): self.left=None self.right=None self.key=key def PrintTree(self): if self.left: self.left.PrintTree() print(self.key) if self.right: self.right.PrintTree() # Insert a child node to the parent node def insert(parent, child, i): if i == 1: parent.left = child else: parent.right = child def CreateBBT(Array,BBT): midkey=math.floor(float(len(Array))/2) BBT.key=Array[midkey] leftArray=Array[0:max(0,midkey)] rightArray=Array[midkey+1:len(Array)] if len(leftArray)!=0: insert(BBT,Node(400),1) CreateBBT(leftArray,BBT.left) if len(rightArray)!=0: insert(BBT,Node(400),2) CreateBBT(rightArray,BBT.right) BBT=Node(500) Range=range(1,8,1) Array=list(Range) print(Array) CreateBBT(Array,BBT) BBT.PrintTree()

def lowcomans(a,b,root): global x if (root==None): return x value=lowcomans(a,b,root.left)+int(root.key==a or root.key==b)+lowcomans(a,b,root.right) if (value==2): print("answer is:",root.key) x=5 return x return value Dropping my answer in python incase someone looks around and want to try (need to define x=0 as a global variable, can do without it but then you can get multiple printings on the answer)

sweet and simple

I think time complexity would be total number of elements * log k, not max number of element in a list * log k.

Great video but it might went too fast when it enters the code part

You merge two building lines but what if there are 3 buildings overlapping, or more?

been trying to understand it for hours and I understood it perfectly in a 15 minute video. thank you so much!

This is my fvrt place to learn kmp

Thank you! Finally understood the algo!

8 years old but still better explanation compared to newer videos explaining the same

best explanation

Almost perfect explanation. Thank you.

Bruh!! killed it in 5 min ...thank u !!❤

though there is a special case that needs to be handled if any of the element in the array is 0 right?

Good job

Best explanation.

if you're from the top, don't give up.

very nice explanation!!

the best and most clear explanation of manacher on YT

Amazing step by step guide!

👏👏👏

this was really the best explanation of this !

bestu bro

Sir please run it for [3,1,2], Thank me laterrrrrrr

aap ne to bacche ko v samjha dia bhayea thanks

Crystal Clear💎

Brooooooo, What a explanation I've searching for hours & yet you managed to explained it within 4 mins <3

Very good explanation!

Since 2-3 days I am finding the video which explains the KMP algorithm in an easy way now find it.... thank you very much

Nicely done, sir! Solved the problem I have been confused for hours!

isnt it a avl tree

Hi there, would anyone please explain to me how this question can be solved for the below test cases with the above logic: test case-1: array = {1, 7, 2, 3, 4, 5, 6} test-case-2: array = {1, 2, 3, 4, 5, 9, 7, 8} I would really appreciate your help

I feel dumb, it was difficult for me to understand even after he wrote it on a slide. smh..

best video to understand Manacher's Algorithm.👍👍