CSProject: Build an LRU CacheCombine a hash map with an ordering structure to build an LRU cache with O(1) get and put that evicts the least-recently-used item, with live visualizers.Aug 18, 2026·6 min
CSHash Maps & Sets: O(1) Lookups ExplainedHow hashing maps a key to a bucket for average O(1) lookups, what collisions and chaining are, and why order isn't guaranteed, with a live visualizer and runnable Python.Aug 12, 2026·6 min
CS
