Video

Great video, thanks for the clear explanation! God bless

bhai jetpack compose ka interview banao pls

Amazing

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.

Revisiting this video, makes me feel good 😄

150 rupiya kaat overacting ka ...

_=[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=" ")

bhai order thoda upar neeche hai

Thanks

This guy disappeared into thin air? I rember yes bck this guy n tht gaurav sen

explained it so well!! thank you so much!

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

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.