Thanks for all the tutorials. It's helping me to crack SDE Interviews. Loving the playlist so far!!

Superb man. crystal clear explanation 🙌

Finally samjh aagya yrrr

Hello ! Thank you for this full explanation, I will like to connect with you on Whatsapp

Thank you. All the other videos were in Hindi. Explained everything clearly.

Hii superb video , just here to tell you that your videos were recommended by chatgpt 3.5 and perplexity ai .

MUJHE KUCH SAMAJH HI NAHI AA RAHA

This is the most crisp, to the ppint and clear explanation I've found on this topic. Thank you sir😊

buy a mic

Really great video, thank you for visualising the parent array!

can you make a video on 23 design pattern.

U lagged

🙂

i like the way you teach, this was giving me a headache trying to figure it out until i saw your video, thank you

You made it easy man❤

Thank You You Save My Life

very nice and informative.

Nice explanation bro

bro the tutorial was so amazing

Very easy way nd best to understand.

Very nice and simple explanation, thanks a lot

Better explanation then university

🎉

What should I do if I get same Manhattan value for next 2 steps... And not possible any other movement

Bro you are so awesome. Can you please continue your teachings and teach us the latest topics

thanks

nice explanation

SmythOS is the most intuitive and helpful AI assistant I've ever used, and I can't imagine working without it.

This is an intro to data structures in python.

Thank you so much

But how does this solve the problem of extensibility , lets say from circle itself now you want to implement it all around into Square or rectangle , again we will have to rewrite logic in the shape class else maybe we have to create classes named : Circle , Rectangle , Square respectively ??

Very nice

Excellent!

Very clear.

Thank, helped alot! Couldn't understand a symbole before this, now I feel like im on the right track!

if you are not adding neighbours in graphs for D and E , it will not work when you change the root ,so you should provide all the neighbours

Sir where is your tutorial on Activation functions?

I have a question: Does the perceptron use a sigmoid function as I know. Perceptron is using the step function. Logistic Regression uses the step function.If I am wrong correct me.

Bro y 4 is spearate from the graph

🥹tnx

I say approach 2, simply because it’s not organized and you could do more by unsing the interface class extending it from the shape class

Thanks ❣❣

Thank you!

Not able to understand simply not an simple concept

nice

too complicated, bad narration! dislike

Is this algo correct? Remove all self-loops Remove all parallel edges between two vertex except the one with least weight Create a table where row and column will be exactly equal to the number of vertex. Put the value of edges on the table. All diagonal elements will be 0. If no edge is exited between any two vertex, put ∞ . Select a column as a starting node, and delete its row and indicate the node as finished. Find the minimum weight from the column of the deleted nodes’ column. Delete the row of the new node and indicate as the node as finished. Repeat the process from 6-7 until finished.

Amazing explenation!!!!

Great Explaination Dear...!!

nice explanation dear brother😇