#### Overview of this book

Golang is one of the fastest growing programming languages in the software industry. Its speed, simplicity, and reliability make it the perfect choice for building robust applications. This brings the need to have a solid foundation in data structures and algorithms with Go so as to build scalable applications. Complete with hands-on tutorials, this book will guide you in using the best data structures and algorithms for problem solving. The book begins with an introduction to Go data structures and algorithms. You'll learn how to store data using linked lists, arrays, stacks, and queues. Moving ahead, you'll discover how to implement sorting and searching algorithms, followed by binary search trees. This book will also help you improve the performance of your applications by stringing data types and implementing hash structures in algorithm design. Finally, you'll be able to apply traditional data structures to solve real-world problems. By the end of the book, you'll have become adept at implementing classic data structures and algorithms in Go, propelling you to become a confident Go programmer.
Preface
Free Chapter
Section 1: Introduction to Data Structures and Algorithms and the Go Language
Data Structures and Algorithms
Getting Started with Go for Data Structures and Algorithms
Section 2: Basic Data Structures and Algorithms using Go
Linear Data Structures
Non-Linear Data Structures
Homogeneous Data Structures
Heterogeneous Data Structures
Dynamic Data Structures
Classic Algorithms
Section 3: Advanced Data Structures and Algorithms using Go
Network and Sparse Matrix Representation
Memory Management
Next Steps
Other Books You May Enjoy

# Questions

1. Where can you use double linked list? Please provide an example.
2. Which method on linked list can be used for printing out node values?
3. Which queue was shown with channels from the Go language?
4. Write a method that returns multiple values. What data structure can be used for returning multiple values?
5. Can set have duplicate elements?
6. Write a code sample showing the union and intersection of two sets.
7. In a linked list, which method is used to find the node between two values?
8. We have elements that are not repeated and unique. What is the correct data structure that represents the collection?
9. In Go, how do you generate a random integer between the values 3 and 5?
10. Which method is called to check if an element of value 5 exists in the Set?