<?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>Hash Table on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/hash-table/</link><description>Recent content in Hash Table on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Wed, 11 Feb 2026 07:59:32 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/hash-table/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 138: Copy List with Random Pointer — A Complete Deep-Copy Breakdown</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/</link><pubDate>Wed, 11 Feb 2026 07:59:32 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/</guid><description>The core of copying a random-pointer list is mapping original node identity to copied node identity, then rebuilding next/random pointers. This article uses the ACERS structure to cover intuition, engineering analogies, pitfalls, and runnable multi-language implementations.</description></item><item><title>LeetCode 1512: Number of Good Pairs (Hash Counting ACERS Guide)</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/</link><pubDate>Tue, 30 Dec 2025 11:40:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/</guid><description>Solve Good Pairs with one-pass hash counting, plus engineering scenarios, complexity, and multi-language solutions.</description></item></channel></rss>