https://jeanphilogong.github.io/jeanblog/tags/hash-table/Recent content in Hash Table on Jeanphilo BlogHugo -- 0.168.0en-usSat, 10 Oct 2026 10:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/1282-group-the-people-given-the-group-size-they-belong-to/Sat, 10 Oct 2026 10:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/1282-group-the-people-given-the-group-size-they-belong-to/Distinguish person IDs from group sizes, collect and split capacity buckets, then build a one-pass Python solution that emits full groups without mutating saved results.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/49-group-anagrams/Sat, 10 Oct 2026 10:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/49-group-anagrams/Build a Python solution one step at a time: compare two anagrams, scan group representatives, then derive sorted-string and character-count keys to understand why hash-table grouping works.https://jeanphilogong.github.io/jeanblog/alg/leetcode/609-find-duplicate-file-in-system/Sat, 10 Oct 2026 10:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/609-find-duplicate-file-in-system/Solve LeetCode 609 step by step: parse directory descriptions, build a correct pairwise baseline, group by content, and account for path construction and real-filesystem limitations.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/146-lru-cache/Mon, 20 Apr 2026 09:36:56 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/146-lru-cache/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.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/Wed, 11 Feb 2026 07:59:32 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/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.https://jeanphilogong.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/Tue, 30 Dec 2025 11:40:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/1512-number-of-good-pairs/Solve Good Pairs with one-pass hash counting, plus engineering scenarios, complexity, and multi-language solutions.