Trie on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/Recent content in Trie on Jeanphilo BlogHugo -- 0.163.3en-usThu, 25 Jun 2026 13:58:00 +0800LeetCode 208: Implement Trie (Prefix Tree) in Pythonhttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/208-implement-trie-prefix-tree/Thu, 25 Jun 2026 13:58:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/208-implement-trie-prefix-tree/Solve LeetCode 208 in Python by deriving Trie node fields, children traversal, is_end, insert, search, startsWith, and the exact interface LeetCode expects.Trie Template Guide: Node Fields, Child Traversal, and Loop Invariantshttps://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/trie-template/Thu, 25 Jun 2026 13:58:00 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/trie-template/Build a Python Trie template from first principles: derive children, is_end, insert/search traversal, prefix lookup, and the loop invariants behind each method.