Go Data Structures Course

Description

Contents

1 Description
2 Why Is This Important?
3 Prerequirements
4 What You’ll Learn
5 Download Links
- 5.1 Related

Knowing what data structures to use in certain scenarios is invaluable and can save heaps (…sorry) of time and effort.

In this course, we’ll be covering everything from arrays and slices in go, all the way through to stacks and queues, before tackling some of the more complex data structures such as linked-lists, binary trees, and graphs.

Once we have laid this foundational knowledge, we’ll be expanding upon it to then look at some of the most common sorting and searching algorithms and how you can effectively implement these in Go!

Why Is This Important?

Knowledge of data structures is not just something you need in order to pass through those tricky technical interviews. It is fundamental knowledge that helps you to design and develop better, more efficient applications that are fit for purpose.

For example, knowing when to use a Set vs an Array for performing specific tasks can help improve the performance of critical sections of your application and also reduce the time wasted debugging why your application isn’t quite working as expected.

Prerequirements

This course will assume a minimal level of experience with Go and the syntax so that we can focus on the underlying computer science concepts.

What You’ll Learn

Arrays and Slices
Sorting in Go
Queues
Linked-Lists

Stacks
Graphs
Binary Trees
Priority Queues

By the end of this course you should have a solid understanding of some of the fundamental data structures and you should be able to smash those technical interviews.

There will be quizzes sprinkled throughout the text sections of this course to help you validate your learning and improve your active recall so that when you need this knowledge, it’s easier to remember.