Видео

Bhai Rachit kaha chle gye .. Harkirat Singh ne aapke Space ko le liya hai actually . Hope u r good

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

Thank you so much for this video. Cleared all my doubts.

IF bloom filter is present per SSt then we would still need to search for all SSTs ?

this video needs to be swapped with 5th video.. videos are out of order in this playlist.

Put this video as 1st video in this playlist. You have misplaced it.

Yrrrr but ye painful 💔 tha ye bhtttt ❤ 😂 Purane yaaade ❤

Thank you! Very well explained in a crystal clear manner with concrete examples, not hand wavy!

pretty messed up

Great video.

What a beautiful video, got all of my questions answered. Subscribed!

IITian interviewing another IITian on how to get into Stanford is unrealistic for most ppl

WHAT???

Good Explanation bro

Participants' engagement in research symposiums showcases their contributions to their fields in the DMP program. Can you make a video discussing symposium presentations?

Thank you so much!!! Tomorrow is my data structures end semester exam :)

nice explanation

Which app are you using for note taking?

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.

This wouldn't work if the input has duplicate?

20:40 ts

really really * 1000

Heart is aching now to explore other loaders - starting first with tsx loader.. thanks for this heart ache 🤩

Could you show how to write code in c++

How is byte sequence retrived?

mujhe software eng banna hai, walmart main naukri karni hai, 27 lakh ka package h, video bna do codehers pe

Easy for cyclic sort if anyone watched @kunalKushwaha will know this one is an easy problem😊

Why not kotlin

Pls loreal brandstorm ke liye tips de dijiye

praise the lord.. ganesh

Great work! Go ahead.

what can we do if the array size is in odd so we would not be able to construct the tree know ?

Non IITian but I feel IIT tag indirectly says you have worked really hard at some point of time in your life.

💛💛💛💛💛🩷💛💛💛

Finallyyyyyy.....❤❤❤The Channel i was looking for

Hello bhaiya, Jio Creative Labs PPI derha hai koi hackathon se. Koi knowledge ho apko?

3:28 Definitions are not quite right. Trees are acyclic and forests are disjoint union of trees so 4-5 is a tree and also forest (on one tree) the other subgraph is neither tree nor forest and the total graph is not a forest. Suppose edge 1-3 is removed to make the first subgraph a tree, I think it would be more typical to say Tree 1 and Tree 2 and call the graph a forest of these two trees.

Loved it❤❤....Changed my mind

we can use lowerbound bro

What is best resources for DSa ??

its just that you have inherited it in public and now that parent secret function can be used as a memeber funciton of overrider class and can access private data members and functions

🎉 thanks for clear cut explanation ❤

*diving deep

Hello bhaiya, mere feed pe Reliance ka competition aya tha wo 26 lakhs tk cash prize de rhe hai, usme kya karna hoga aap bata do please

why did you stop the video when he started talking about the cost?

5:13 How is Data Distributed - Replication vs Partitioning, I think in this you are talking about sharding not partitioning. Becuase when we talk about data split into multiple machines that is sharding.

How would you go on to build this kind of tree though? and what is the time complexity for making it?

0:55 you made a mistake.. its up to 8 not 10. otherwise very good ! i learned a lot

May I ask these data structures are to store the actual raw data themselves in the database? They are not indexing structures? Because I thought these are for indexing strategies? thank you for the video!