in any DSA textbook we'll find out that we have two ways to implement maps - so called "hashmaps" and and the less common "treemaps".
which makes me wonder: why are there no "linked list maps"?
reading elements would obviously be slower - O(n) vs O(log n) - but inserting can be faster if we keep a reference to the tail of the linked list - O(1) vs O(log n).
am i missing something?

another day, another leetcode grind.

we're all gonna make it.

you spend your nights watching netflix slop
i spend my nights grinding leetcode
we are not the same