leetcode-explore-challenge-card-may-leetcoding-challenge-535-week-2-may-8th-may-14th-3329.cpp

class Trie {
    Trie * children[26];
    bool isEndofWord;    
    
public:
    /** Initialize your data structure here. */
    Trie() {
        
        isEndofWord=false;
        for(int i=0;i<26;i++){
            children[i]=nullptr;
        }
    }
    
    /** Inserts a word into the trie. */
    void insert(string word) {
        Trie * curr =this;
        for(char c : word){
            if(!(curr->children[c-'a']))
                curr->children[c-'a']= new Trie;
            curr=curr->children[c-'a'];
        }
        curr->isEndofWord=true;
    }
    
    /** Returns if the word is in the trie. */
    bool search(string word) {
        Trie * curr=this;
        for(char c : word){
            curr=curr->children[c-'a'];
            
            if(!curr)
               return false;
        }
        if(curr->isEndofWord){
            return true;
        }
        return false;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    bool startsWith(string prefix) {
        Trie * curr=this;
        for(char c : prefix){
            curr=curr->children[c-'a'];          
            if(!curr)
               return false;
        }
        return true;
    }
};