<commit_before>
struct Node {
    Node * ch[26];
    string str;
    Node() {
        for (int i = 0; i < 26; ++i)
            ch[i] = NULL;
            str = "";
    }
};

class Solution {
public:
    
    vector<string> results;
    Node * root;
    void insert(Node* p, string s) {
        int len = s.size();<commit_msg>using trie to solve 132<commit_after>
struct Node {
    Node * ch[26];
    string str;
    Node() {
        for (int i = 0; i < 26; ++i)
            ch[i] = NULL;
            str = "";
    }
};

class Solution {
public:
    
    vector<string> results;
    Node * root;
    //trie insert 
    void insert(Node* p, string s) {
        int len = s.size();
{'fraction_non_alphanumeric': 0.1447562776957164, 'fraction_numerical': 0.019202363367799114, 'mean_word_length': 1.6484375, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '837963', 'n_tokens_mistral': 246, 'n_tokens_neox': 233, 'n_words': 71}