Summary
This chapter talked about many interesting and practical topics, including implementing linked lists, doubly linked lists, hash tables, queues, and stacks in Go, as well as using the functionality of the container standard Go package, verifying Sudoku puzzles, and generating pseudo-random numbers, along with difficult-to-guess passwords, in Go.
What you should remember from this chapter is that the foundation of every data structure is the definition and the implementation of its node. Lastly, we talked about performing matrix calculations.
I am sure that you will find the next chapter to be one of the most interesting and valuable chapters of this book. The main topic is Go packages, along with information about how to define and ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access