Linked List in Go (Data Structures and Algorithms - Golang)

preview_player
Показать описание
Linked List in Go - This is the first of a multi-part series covering data structures and algorithms in Golang

In this programming tutorial I discuss linked list which is a common starting point when learning data structures and algorithms. Major tech companies like Facebook, Amazon, Google and Netflix are notorious for requiring their candidates to have an in depth knowledge of data structures and algorithms regardless of the programming language that you are familiar with. In this tutorial I explain what linked list are and when to use them. I compare them to arrays and provide a detail coding example of how to create them.
Рекомендации по теме
Комментарии
Автор

Bruh ur life saver I'm literally learning liked list in golang toady and BIG O definitely needed concept

nameless_
Автор

It is not easy to make this explanation simple and graphical. I really liked the video ! Thanks !

alexrabocse
Автор

Thanks, man it was awesome to see the series ....!please continue

ibandari
Автор

I really like the way you explain. It's so detailed. There is a channel called "Anthony GG". It would be nice to see doing similar stuff, he creates real world stuff while explaining what he is doing. I think you could create your own projects in that style.

kowalski
Автор

Awesome, love to see it implemented in Golang. Hope you create more videos on DS & Algorithms!

mpaujan
Автор

This is really good. I have seen many videos on this topic in Youtube, they either lack visual explanation or not able to make the concepts clear. Please go head and create the number one content on data structures and algorithms using golang. You got me subscribed.

TheMouseJerry-dumd
Автор

The animations really helped me wrap my head around Previoustodelete. Thanks a ton for your effort. Sharing is caring. Hope you keep posting more. you have a knack for making concepts tick.

winter_light
Автор

to be honest, thank you a lot for this tutorial, so useful and informative

mrdiverx
Автор

just keep going, man! You are a life saver!

nurlanikhsanov
Автор

It is a really great tutorial. I learned a lot from this video. Thank you.

AsaduzzamanSohel
Автор

Thank you very much for this video, concise and very helpful

Dan-rhtn
Автор

Wow, you deserve much more subscriber

AshishSinghh
Автор

Thanks, waited a long for this series 😌

nonamenigha
Автор

Thanks again and again for your Effort you helped me alot specially functions, Pointers and interfaces

pss_crs
Автор

This is something I need to get going for interviews.

codelinx
Автор

Do you plan on adding more videos for Go? Especially for Data Structures and Algorithms.

JimRohn-uc
Автор

Here your printlist output is reversed which means the head pointed to the last node, hence the head is in the place of tail and the values gets added back to the head. Can you please do a video by adding nodes next to the head and with a ending tail.

zeb
Автор

Could you tell me why did you use (l *linkedlist) after the func and what is the reason to use & before the newnode, l.head = &newNode ?

rezaulmasum
Автор

Hey my dude, would be great to get a deeper more comprehensive course that goes from novice to competent algo course on Udemy that covers use cases and examples. I'd pay for a course if you made one :). With lots of exercises and quizzes..

seanknowles
Автор

Excelent video! Homework for the audience, what should be modified in deleteWithValue method to support deletion of all ocurrences of that value. ;)

juanpablogonzalezquinteros
visit shbcf.ru