2 жыл бұрын
Пікірлер
@itssecret3780 13 күн бұрын
Write ahead log is always written to when writing which is disk i/o, kindly correct that. Edit: You explained in last, good video. Thanks.
@aditigupta6870 19 күн бұрын
Why 1a and 0a? No explanation of that..
@kaal_bhairav_24 27 күн бұрын
Amazon DynamoDB uses Single Leader replication and not leaderless replication The Dynamo Paper describes Multileader replication but DynamoDB implementation chose Single Leader replication
@biswajit-k Ай бұрын
Exactly what I was looking for! Thanks a lot
@erock7073 2 ай бұрын
Great video, thanks for the clear explanation! God bless
@justloveandpeace4010 2 ай бұрын
bhai jetpack compose ka interview banao pls
@FunPart-xr4jg 3 ай бұрын
Amazing
@yug._.27 3 ай бұрын
Mines is not working, it's some kind of version error. (Edit): It is working for the tittle but the you tube thumbnails are not being blur.
@siddharthmagadum16 3 ай бұрын
Revisiting this video, makes me feel good 😄
@ashutosh_verma_fullstack 3 ай бұрын
150 rupiya kaat overacting ka ...
@ashutosh_verma_fullstack 3 ай бұрын
_=[print((20-i)*' ' + '*'*(2*i+1) if i < 10 else ' '*20+'*') for i in range(15)] or print(*[(20-i)*' ' + '*'*(2*i+1) if i < 10 else ' '*20+'*' for i in range(15)], sep=" ")
@ashutosh_verma_fullstack 4 ай бұрын
bhai order thoda upar neeche hai
@AdnanAbdulBasir 4 ай бұрын
Thanks
@a1988ditya 4 ай бұрын
This guy disappeared into thin air? I rember yes bck this guy n tht gaurav sen
@codingwithnamit8551 4 ай бұрын
explained it so well!! thank you so much!
@killerthoughts6150 4 ай бұрын
what the hell, after 11 mins of patiently waiting for the way to do the sum, I learn that its in part 2 whose link is not here. GOD, thanks though learnt the space complexity is O(n) but it took 11 mins for that I learnt there hasn't been part 2 at all ......
@dfhg315 3 ай бұрын
but what is use then to generate segment tree it take o(n) time. Instead we can use the brute force method. I ask the same question to the charge GPT it tells that for generating it takes n / log n time complexity not o(n) this is response of chatgpt ===> No, generating or building a segment tree from an array takes \(O(n \log n)\) time complexity, not \(O(n)\). Here's why: - **Building the tree:** Each level of the segment tree represents a merging of nodes from the previous level. If there are \(n\) elements, there are \(O(\log n)\) levels in the tree because the height of a segment tree is \(O(\log n)\). - **Merging nodes:** Each level has at most \(n\) nodes, and merging each node involves a constant amount of work. Therefore, the total time to build the segment tree is \(O(n \log n)\).
@nitesh__sharma 4 ай бұрын
Bhai Rachit kaha chle gye .. Harkirat Singh ne aapke Space ko le liya hai actually . Hope u r good
@saurabhmittal6947 4 ай бұрын
I believe, longest valid parentheses can be solved by maintaining a simple stack and keep removing the valid parentheses and maximising the length which will be calculated using the difference between current index and stack's top element index
@OnTheGoRahul 4 ай бұрын
Thank you so much for this video. Cleared all my doubts.
@saurabhmittal6947 4 ай бұрын
IF bloom filter is present per SSt then we would still need to search for all SSTs ?
@saurabhmittal6947 4 ай бұрын
this video needs to be swapped with 5th video.. videos are out of order in this playlist.
@saurabhmittal6947 4 ай бұрын
Put this video as 1st video in this playlist. You have misplaced it.
@stanlyjsamuel 5 ай бұрын
Thank you! Very well explained in a crystal clear manner with concrete examples, not hand wavy!
@mothafucka 5 ай бұрын
pretty messed up
@balkiprasanna1984 5 ай бұрын
Great video.
@AbrarAhmed-sz9qz 6 ай бұрын
What a beautiful video, got all of my questions answered. Subscribed!
@_its._gaurav._ 6 ай бұрын
IITian interviewing another IITian on how to get into Stanford is unrealistic for most ppl
@norcal8718 6 ай бұрын
WHAT???
@juhairahamed5342 6 ай бұрын
Good Explanation bro
@zorogamer9629 6 ай бұрын
Participants' engagement in research symposiums showcases their contributions to their fields in the DMP program. Can you make a video discussing symposium presentations?
@NikitaNair 6 ай бұрын
Thank you so much!!! Tomorrow is my data structures end semester exam :)
@JohnnyRotten-uf6xw 14 күн бұрын
You have segment tree for your undergerad?!? Which college is this man.
@sanasainath7758 7 ай бұрын
nice explanation
@akicr7 7 ай бұрын
Which app are you using for note taking?
@dasstraat 8 ай бұрын
Network load is not a crucial factor anymore. There is however no decent standardized way to convert C++ to JSON. For grpc there is a convertor for this, although the files are ridigoulous comp[licated to read.
@zkkzkk32312 8 ай бұрын
This wouldn't work if the input has duplicate?
@tarunmali6228 8 ай бұрын
20:40 ts
@ankitpahwa8571 8 ай бұрын
really really * 1000
@abhinavsrivastava2128 8 ай бұрын
Heart is aching now to explore other loaders - starting first with tsx loader.. thanks for this heart ache 🤩
@Relaxation_music_calm 8 ай бұрын
Could you show how to write code in c++
@kambalavijay6800 8 ай бұрын
How is byte sequence retrived?
@priyanshikmv 9 ай бұрын
mujhe software eng banna hai, walmart main naukri karni hai, 27 lakh ka package h, video bna do codehers pe
@karthikk2316 9 ай бұрын
Easy for cyclic sort if anyone watched @kunalKushwaha will know this one is an easy problem😊
@bhaumikpandya2058 9 ай бұрын
Why not kotlin
@priyanshikmv 10 ай бұрын
Pls loreal brandstorm ke liye tips de dijiye
@chuckynorris616 10 ай бұрын
praise the lord.. ganesh
@iftakharuddin4082 10 ай бұрын
Great work! Go ahead.
@albert.praveen 10 ай бұрын
what can we do if the array size is in odd so we would not be able to construct the tree know ?
@RachitJain 10 ай бұрын
if you are doing sum range queries, you can append 0s to array to give it the size you need
@vaibhavdesai16 10 ай бұрын
Non IITian but I feel IIT tag indirectly says you have worked really hard at some point of time in your life.
@divya__shakya 10 ай бұрын
Finallyyyyyy.....❤❤❤The Channel i was looking for