Given the simple programming problem of testing two words of being anagrams I've found my simple solution I did a few years back. I decided to rework it into a much simpler solution using Python's Counter collection. But then I tried measuring the performance and was rather surprised.
Given a string containing characters interspersed with brackets, each bracket should have a closing bracket somewhere later in the string while keeping the order of the opening brackets in mind when closing then. That is the lastest opening bracket should be the first to be closed.
This was my revised solution...
So I started out with making music with the purpose of learning music production of various music genres. My first real attempt to make a drum loop resulted in this and I'm somewhat proud of it.