https://h30306.github.io/blog/tags/trie/Recent content in Trie onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/algorithm/trie/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/trie/Building a Trie from nested dicts, counting on nodes, pairing it with DFS, and when a Trie is not actually neededhttps://h30306.github.io/blog/leetcode/leetcode-212/Fri, 16 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-212/LeetCode 212 note: build a Trie of all words, walk it during the grid DFS, remove words once found, and prune empty nodeshttps://h30306.github.io/blog/leetcode/leetcode-2416/Sun, 13 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2416/LeetCode 2416 note: each Trie node counts the words passing through it, and a word’s answer is the sum of counts along its pathhttps://h30306.github.io/blog/leetcode/leetcode-1178/Fri, 28 Aug 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1178/LeetCode 1178 note: a word only matters by its set of letters, so count 26-bit masks and enumerate each puzzle’s submaskshttps://h30306.github.io/blog/leetcode/leetcode-1023/Thu, 19 Mar 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1023/LeetCode 1023 note: two pointers character by character; anything beyond the pattern must be lowercasehttps://h30306.github.io/blog/leetcode/leetcode-2781/Wed, 14 Jan 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-2781/LeetCode 2781 note: forbidden words are at most 10 long, so each right end checks only the last 10 suffixes; on a match push the left end past it, using the shortest match (the rightmost start)https://h30306.github.io/blog/leetcode/leetcode-208/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-208/LeetCode 208 note: each node is a children dict plus an is_end flag; insert, search and startsWith all walk down character by characterhttps://h30306.github.io/blog/leetcode/leetcode-14/Thu, 19 Sep 2019 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-14/LeetCode 14 note: bound by the shortest string and check each position across all strings; the first mismatch gives the answer’s length