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

@JTST1234

3 жыл бұрын

and beautiful writing too

@codewithkolhar3131

3 жыл бұрын

Black ink

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

Sweet voice and superb explaination. :)

You explained it perfectly. Thank you so much.

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

you are sooo clear! thanks so much for ur videos

Great work!!!👍

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

Perfect Explanation.....👍

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.

clear explanation !!

:) HAPPY TO HEAR SUCH CLEAR ONE

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

Subscribed wowwwwww very gud explanation

I cleared the subject because of you thanks

Thank you mam for this amazing explanation 😊

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

at last i understood it ! thanks alot . great explaining

@farooqarshad9955

3 жыл бұрын

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

Superb explanation

well explained..Thank you

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

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?

@JasonKT13

3 жыл бұрын

its on a leaf...

pleasent explaination

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

Nice explanation mam tq

Is that space complexity or time complexity 🙃

nice represetation

Why root node is empty?

maam can you make video on KMP pattern

nice

can you upload on pattern matching algorithum

@muzzu7631

4 жыл бұрын

Sir jb class me padare the jb aap kya karre the @sameer khan

@Saud_khaled_7989

4 жыл бұрын

Sir padate waqt jhak marare the

@mohammedsameerkhan736

4 жыл бұрын

@@Saud_khaled_7989 han

In exam we should write this like only

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

@madheshmedasani2078

3 жыл бұрын

If we consider the set s={meaning,meaningful},can't distinguish the word "meaning" because it is included in the word "meaningful"

@farooqarshad9955

3 жыл бұрын

@@madheshmedasani2078 Thanks bro

Her voice 😍

love your voice madam ji sat sri akal vere

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

@shaiksadik2541

4 жыл бұрын

Jntu?

@anushareddy2122

4 жыл бұрын

Lol!! Satya

@sathya3596

4 жыл бұрын

@@anushareddy2122 😂😂oh shitt... Even ur here

@sathya3596

4 жыл бұрын

@Sai Sharan nailed it

brute force algorithm

notes

Please can you reveal your face mam..

@admirald.rifter1819

Жыл бұрын

man is down bad

@ultron_kk

2 ай бұрын

Down to earth

nice explanation