Tries 

I grappled with this particular algo for long time but finally you explained it clearly Lalitha. Cheers

Watching you writing and explaining was so satisfying 😌. Amazing explanation 💯

I love the setup. Red in contrast with white paper. Just amazing!!!

I love this concept, the way you explained the topic. I was searching for the video of this topic for my exam. Thank you so much !!!! for this video

Well explained sister ❤️ very much understood ! THANK YOU ☺️

you are sooo clear! thanks so much for ur videos

You explained it perfectly. Thank you so much.

Thank you for this amazing explanation! I am curious though, could we not have a word that is a prefix of another word still? Let's say we have a boolean value in our Node class that is set to true if the node is an end of a word. So in the case of autocomplete, when we type b it would first try to guess that we are trying to spell be, but if we continue spelling and type bea it would suggest the next complete word which would be bear.

Great work!!!👍

Thank you all your explonation, IT IS AMAZING!!!!

Sweet voice and superb explaination. :)

clear explanation !!

Perfect Explanation.....👍

:) HAPPY TO HEAR SUCH CLEAR ONE

clean explaining thanx for the help and wishing you great day or night

does the list need to b sorted before inserting into the trie

I cleared the subject because of you thanks

at last i understood it ! thanks alot . great explaining

Thank you mam for this amazing explanation 😊

Superb explanation

Only 18 secs in the video. And fell in love with your handwriting

Subscribed wowwwwww very gud explanation

well explained..Thank you

Thank you so much didi aapne toh exam bacha liya , such a clear explanation ❤❤❤

Thanks alot!

for inserting bell, L was inserted . Then comes second L, you said if it finds the letter it won't insert. So how does it distinguishes?

pleasent explaination

Is that space complexity or time complexity 🙃

mam there will no duplication in the trees so no need to write l second time

Nice explanation mam tq

Why root node is empty?

nice represetation

maam can you make video on KMP pattern

nice

can you upload on pattern matching algorithum

In exam we should write this like only

Her voice 😍

love your voice madam ji sat sri akal vere

no word in S should be the prefix of other word ? I Dnt understand this part can anyone explain this by example please ?

😮 perfect ...... Continue making videos👍😂u saved me I have ds exam 2mrw

brute force algorithm

notes

Please can you reveal your face mam..

nice explanation