Відео

Hey thank you so much for creating this video! I've been trying to process the merge sort algorithm by myself for weeks but couldn't really understand some parts of it and decided to give up and search the internet. That was when I came across your video and you actually explained it so well in 9 minutes!! I deeply regret wasting a week on this lol

seeing this video in 2024

bro posted the biggest DSA bang and left

Too much for my brain right now. All I think i understand is that, each element is an instantiation of the node class and you modify it using the functions. Need to learn py… and OOP more 🙃 But maybe, I'd actually understand it more in Java 🤔

Great content Brian. Thank you.

First dsa video! the keyboard sound was just 🤩

After searching thousand of videos at ytb, this tutorial is the most helpful and insightful! thanks!

Bro you're different level

didn't get shit.

This got me passed my bootcamp. I watched as many as 5 different binary search tree node remove videos but I could not figure out how how to do it. I stumbled onto this video and I watched it multiple times. It finally clicked. Thank you. I would still be sitting at my computer without this.

Broooo, thank you very much. I search how to delete a node for 2-3 hours. You saved me

At 11:50 I think it should be if index > self.length() instead of index >= self.length() This will ignore the last element and it cannot be accessed. I am still a newbie, correct me if I am wrong. Anyway, great series, thank you sir

Why are you creating 2 classes

thanks for your help!

Can't we just say while current != None (or while current)? we dont necessarily need to make sure we have 2 nodes before null right?

moueeeeeeeeeeeeeeeeeeee

Thank you so much for this! This is just what I needed to understand linked lists properly!

Dictionary has been made an Ordered collection since Python 3.7

I struggled a lot with DSA until I found this channel. Now I struggle a lot less thanks to you.

I love you man

I know I'm really late about these ones, but thanks a lot for all your videos. They could'nt be more useful before my python test. I don't understand why arn't u already famous ! Ur explanations are so clear please never stop doing video's

This week I found your videos, for a topic that I really didn't understand and I just want to thank you for your work! you explain very well, I love to learn like this. Keep it up, you must upload videos transmitting your knowledge

very understandable !

Great video. On your erase, I think it is essential to reassign the self.head for when erase is called at index= 0 so that it does not stay as None

Instead of doing another costly iteration through the linked list to find the size of it. We can add a self.length variable to the init() with an initial size of 0, and then add a 1 in the append() and a subtract a 1 in the remove method

Do you have video in Graph a nd algorithm

doesn't work if you repeat deletion of the same value fyi For the function delete_value, we need to catch this edge case. def delete_value(self, value): if self.find(value) == None: #if we can't find the value return None return self.delete_node(self.find(value))

My nigga, good stuff

Thanks, Brian. Really helpful.

dunno how it worked for you but i had to set "self.head = None" otherwise i got an error that attribute "data" is missing

Thank you I was wondering how do you create pointers in Python. My favourite languages are C++, C#. It took me three years to learn them. I think I’m going to give Python a try, it looks easy. Thank you.

Actually this implementation is not 100% correct. The actual first element or the head of the linkedList will always be none as per the provided implementation. You would have to check if the head has a next element and if its data is none. If so, the head node should get the data: def append(self, data): new_node = Node(data) current = self.head while current.next is not None: current = current.next if current == self.head and self.head.data is None: current.data = data else: current.next = new_node

Your explanation is too clean and lucid.Thanks for a great video!

Great video dude, it helped me a lot!

Do you still freedive in the NJ area?

The code is not readble at all , also the header is always none and you built the code on that not a good way of coding linkedlist to be honest

why would someone use this over a normal list? i cant think of a situation where a linked list would be more useful when compared to an array

Thank you, helped me finish my homework without losing my mind x'D

Hello, yes I do enjoy your videos and teaching method/style. Wish there were more video's to view.

thank you so much

I agree.

Great video, thanks for the post.

I love you dude thanks for explaining this stuff so clearly. So many other channels explain this stuff so badly, but you make it so easy to understand.

Great Vidéos !!!!

.

thank you

thank you for explaining the erase method, I was confused from another video on how the element gets deleted by just assigning the last node

Quick and short recap.

What textbook are the screenshots from? For example at time stamp 3:25

as u can see a single neuron in a neural network is one complete output on a single layer. so a single layer with one output is just one single neuron.