<?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>Doubly Linked List on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/doubly-linked-list/</link><description>Recent content in Doubly Linked List on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Mon, 20 Apr 2026 09:36:56 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/doubly-linked-list/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100: LRU Cache Hash Table + Doubly Linked List O(1) ACERS Guide</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/146-lru-cache/</link><pubDate>Mon, 20 Apr 2026 09:36:56 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/146-lru-cache/</guid><description>Design an LRU cache where both get and put run in O(1) average time by combining a hash table with a doubly linked list. This ACERS guide derives the data-structure split and includes runnable multi-language implementations.</description></item><item><title>LeetCode 146: LRU Cache Design with O(1) Hash Map + Doubly Linked List</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/146-lru-cache/</link><pubDate>Thu, 12 Feb 2026 13:51:08 +0800</pubDate><guid>https://jeanphilogong.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>