Problem Statement: Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array elements between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array.
For this second installment of Getting Going With Go, we’re going to cover
slices – how to create them, how to add more elements to them, and how to retrieve the elements of them individually. We’ll also cover how what
maps are in Go and how to create them.