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
CSLinked Lists: Pointers, Nodes & Trade-offsLinked lists chain nodes with next pointers for O(1) inserts but O(n) indexing. See the trade-offs vs arrays with an interactive visualizer and runnable Python.Aug 16, 2026·5 min
CS
