AI Notes

Learn a lot

Tag: Trie

  • Pseudo Code for Trie Data Structure

    Pseudo Code for Trie Data Structure // Trie Data Structure Class TrieNode: isEndOfWord: Boolean // Indicates if this node marks the end of a valid word children: Dictionary<Character, TrieNode> // Maps characters to child nodes Constructor(): isEndOfWord = False children = new empty Dictionary Class Trie: root: TrieNode Constructor(): root = new TrieNode() // Insert… Read more

  • Efficient String Search algorithms among Millions of Strings

    Efficient String Search in a Large List (2025) Searching for a specific string within a list containing millions of entries requires efficient algorithms and data structures to avoid performance bottlenecks. A simple linear search would be highly inefficient in this scenario. Here are several efficient ways to tackle this problem in 2025: 1. Using a… Read more