Insert Delete GetRandom O(1) | leetcode 380 | Hindi

[@yashikant5819]

amazing explanation...i previously thought only hashset is enough but now I have got a new idea

[@anirudhbhat5093]

wow! i really tried this with hashset ! you are so experienced that you know what people are going to do! amazing man . P.S : still waiting for comparator video

[@codebix1096]

Glad to hear that! and wait for few days i will make videos on comparator interface as well :)

[@himanshuchhikara4918]

Sir love to see ur videos .. Respect from core of my heart ur explanation is amazing

[@codebix1096]

So nice of you

[@madanmohanpachouly6135]

Bhai dil jeet lia ...

[@santasingh9045]

hats off to your amazing explantion. keep up the good work.

[@codebix1096]

Keep watching

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@shivanshutiwari5646]

sir ,please try to write code in c++ also, because some newbie have a problem to convert code into c++ and you can easily write code for c++ just spending 2-5 more minutes.

[@codebix1096]

tbh i don't code in c++ but you can easily find code in c++ on internet

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@kumarshivam8077]

If we comvert hashset to array and search using random index we can get it in constant time.

[@codebix1096]

what is the time complexity for this conversion?

[@kumarshivam8077]

@@codebix1096 ok i got it. It will be O(n)

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@aryangrover7216]

Very Nice Explanation Sir

[@arpitsatnalika]

Amazing explanation

[@codebix1096]

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@saranshsaxena6233]

When I am submitting this solution on leetcode it is giving me error of illegal bound! ! What to do??

[@durgeshnandan5181]

Insert(5) insert(5) remove(5) for this query the given approach is wrong as we are storing 5 once only after removal datastructure should have 5 but it doesn't.

[@ankushroy919]

wow 😮 keep it up sir,well explained

[@codebix1096]

Keep watching

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@harshitawasthi2420]

Thanks Bro! Very Helpful ;)

[@ankushroy919]

sir pls upload a video on google kickstart 2020 round c specially perfect subarray prblm

[@codebix1096]

ankush rn i am already uploading videos on graphs and leetcode june challenge maybe after graph i can but abhi i can't

[@ankushroy919]

ya sure sir

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@HarshSharma-ff3ox]

Great explanation

[@codebix1096]

Glad you liked it Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

[@iamkdblue]

In Hashset Method :- "HashSet does not maintain any order" so first element return kr de random ki jarurat hi nahi hai, am i right?

[@codebix1096]

No you are right that it doesn't maintain any specific order but it maintains some order right if you return only first character every time how it will be equally probable?

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@kushaalrana]

Too good👌

[@codebix1096]

Thanks a lot 😊

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@saikatbiswas3549]

nice

[@codebix1096]

Thanks

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

[@yasssh7835]

thanks!

[@codebix1096]

Welcome!

[@codebix1096]

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about