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

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

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

yashikant
Автор

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

anirudhbhat
Автор

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

himanshuchhikara
Автор

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

santasingh
Автор

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.

shivanshutiwari
Автор

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

kumarshivam
Автор

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

saranshsaxena
Автор

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.

durgeshnandan
Автор

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

iamkdblue
Автор

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

ankushroy