Hello there! In this unit, we're offering an engaging coding lesson that highlights the performance efficiencies offered by utilizing efficient data structures in Go. We'll address a slice-based problem that requires us to make an optimal choice to minimize the size of our slice. Excited? So am I! Let's get started.

In this unit's task, we'll manipulate a slice of integers. You are required to construct a Go function titled MinimalMaxBlock(). This function should accept a slice as an input and compute an intriguing property related to contiguous blocks within the slice.

More specifically, you must select a particular integer, k, from the slice. Once you've selected k, the function should remove all occurrences of k from the slice, thereby splitting it into several contiguous blocks or remaining sub-slices. A unique feature of k is that it is chosen such that the maximum length among these blocks is minimized.

For instance, consider the slice [1, 2, 2, 3, 1, 4, 4, 4, 1, 2, 5]. If we eliminate all instances of 2 (our k), the remaining blocks would be [1], [3, 1, 4, 4, 4, 1], and [5], with the longest containing 6 elements. Now, if we instead remove all instances of 1, the new remaining blocks would be , , and , the longest of which contains 3 elements. As such, the function should return 1 in this case, as it leads to a minimally maximal block length.