<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Cache on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/cache/</link><description>Recent content in Cache on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Thu, 12 Feb 2026 13:51:08 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/cache/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 146: LRU Cache Design with O(1) Hash Map + Doubly Linked List</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/146-lru-cache/</link><pubDate>Thu, 12 Feb 2026 13:51:08 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/146-lru-cache/</guid><description>Implement LRUCache with O(1) average get/put by combining a hash map for lookup and a doubly linked list for recency order. Includes ACERS reasoning, engineering mapping, and runnable multi-language code.</description></item></channel></rss>