LRU Cache Data Structure | Interview Cake
A Least Recently Used (LRU) Cache is a cache data structure that's often implemented by pairing a doubly linked list with a hash map. It's the basis for many caching systems.
LRU Cache: How It Works (Data Structure & Code) | Interview Cake Interview Cake by Exponent Toggle navigation Interview Cake by Exponent Coding Questions All Questions Language-Specific Prep Python Interview Questions Java Interview Questions Javascript Interview Questions Company-Specific Prep Google Interview Questions Meta Interview Questions Amazon Interview Questions Tips First coding interview? Start here. General coding interview tips How to get un-stuck Beating impostor syndrome 24 hours before your onsite Why you're hitting dead ends Best ways to practice Organizing your interview tim
Explore this link on the map →related reading
- Analyzing the codebase of Caffeine: a high performance caching library | Adri’s Blogadriacabeza.github.io
- abseil / Performance Hintsabseil.io
- Cache Memory in Computer Organization - GeeksforGeeksgeeksforgeeks.org
- Disk Cachechromium.org
- How L1 and L2 CPU Caches Work, and Why They're an Essential Part of Modern Chips | Extremetechextremetech.com
- Build Your Own Databasenan.fyi
- Bloom Filters - Much, much more than a space efficient hashmap! | Ben E. C. Boyterboyter.org
- Dropboxdropbox.com
- Linked list - Wikipediaen.wikipedia.org
- How Cursor Indexes Codebases Fast - by Engineer's Codexread.engineerscodex.com
- The true cost of linked lists · YKarroumykarroum.com
- Why do CPUs have multiple cache levels? | The ryg blogfgiesen.wordpress.com