A flight last Sunday meant I was so sleepy I skipped sending last week’s newsletter… so this week is super-sized. A lot of content about distributed teams I think.
NOTE: Scala, distributed teams and a bit of a random selection. Expect a similar wide range in the future as well. You can check all my weekly readings by checking the [tag here](https://www.mostlymaths.net/search/label/ReadingsOfTheWeek, Readings). You can also get these as a weekly newsletter by subscribing here.
Suffix trees are excellent for certain search problems (many documents or large document for a limited amount of patterns or variable patterns). Its dual (many documents or large documents for many patterns) would he Aho-Corasick’s algorithm (or some of its improvements)
I recently re-watched the whole TNG (I think it may have been the 3rd time for me) with my partner. And indeed, watching everything is a bit of a chore: the selection here is what I would have also picked, and I think builds up correctly up to Inner Light.
Monads… in Python. And also, well explained. I prefer to think as monads as “containers offering a way to be merged together” (as in… functor… monoid) but the explanation here (and the Python class magic) are good.
I saw this recently in Twitter (not sure who shared, it was a “Scala person”), and I remembered reading it when it was posted. Since it was before Readings of the Week started, I think it never got shared, so enjoy.
I’ve been exploring possible solutions to “remote whiteboard” and Miro seems an excellent proposition. It’s like a better version of LucidCharts, but with real time editing capabilities. Also, Wardley maps, yes. Obviously it’s written by Ben, who is everywhere maps appear 🤣
These weekly posts are also available as a newsletter. These days (since RSS went into limbo) most of my regular information comes from several newsletters I’m subscribed to, instead of me going directly to a blog. If this is also your case, subscribe by clicking here.