Strange Container

[aklepatc]

Code a data structure with 2 operations: push() and popMostFrequent().

Most of the meat is in the comments/discussion below.

Comments

[sassa_nf]

Well, it is surprising to those familiar with java byte buffers. Slicing a buffer there creates a slice of the underlying buffer, but does not share its limit - can't go beyond the last byte available in the buffer at the time of slicing, even if the capacity allows for that.

So to speak, cap(n)==len(n) immediately after slicing.

[aklepatc]

Interesting. Lots of ways to slice it. Lol.

Go ways are very similar to C ways. So old C ppl find Go easy. In particular, Go slicing resembles C pointer arithmetic when it's used say to move a window over a larger array.