Basic Data Structures in Go: Maps
Continuing with our series of blog posts on what we've been learning about Go in the process of solving problems on Rosalind.info, this post will cover how some basic data structures work in Go, and how we used each to solve problems from the Chapter 1 Rosalind problems.
The simplest way to describe a map is to say it is a structure useful for storing key-value pairs.
Before we walk through what maps look like in Go, let's talk about what a map is (in the data structure sense). And to do …