Python sets and dictionaries can have quadratic-time performance

I assume the intent is to teach new programmers about less-than-obvious things that teachers might easily gloss over. But it comes across largely as FUD about things that are well understood in the field (and have been for decades) and are not Python-specific at all despite the hook. Especially since there is no mention of the efforts taken to avoid intentional collision attacks for string keys.

I would rather have had a more detailed writeup of the package the author is promoting at the end[1], which is apparently also due to the blog author.

[1]: https://pypi.org/project/fastconstmap/, "a C implementation of the binary fuse filter construction (a static perfect-hash-like structure), exposed to Python"