<p>A <strong>valid encoding</strong> of an array of <code>words</code> is any reference string <code>s</code> and array of indices <code>indices</code> such that:</p>

<ul>
	<li><code>words.length == indices.length</code></li>
	<li>The reference string <code>s</code> ends with the <code>&#39;#&#39;</code> character.</li>
	<li>For each index <code>indices[i]</code>, the <strong>substring</strong> of <code>s</code> starting from <code>indices[i]</code> and up to (but not including) the next <code>&#39;#&#39;</code> character is equal to <code>words[i]</code>.</li>
</ul>

<p>Given an array of <code>words</code>, return <em>the <strong>length of the shortest reference string</strong> </em><code>s</code><em> possible of any <strong>valid encoding</strong> of </em><code>words</code><em>.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;time&quot;, &quot;me&quot;, &quot;bell&quot;]
<strong>Output:</strong> 10
<strong>Explanation:</strong> A valid encoding would be s = <code>&quot;time#bell#&quot; and indices = [0, 2, 5</code>].
words[0] = &quot;time&quot;, the substring of s starting from indices[0] = 0 to the next &#39;#&#39; is underlined in &quot;<u>time</u>#bell#&quot;
words[1] = &quot;me&quot;, the substring of s starting from indices[1] = 2 to the next &#39;#&#39; is underlined in &quot;ti<u>me</u>#bell#&quot;
words[2] = &quot;bell&quot;, the substring of s starting from indices[2] = 5 to the next &#39;#&#39; is underlined in &quot;time#<u>bell</u>#&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;t&quot;]
<strong>Output:</strong> 2
<strong>Explanation:</strong> A valid encoding would be s = &quot;t#&quot; and indices = [0].
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 2000</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 7</code></li>
	<li><code>words[i]</code> consists of only lowercase letters.</li>
</ul>

class trieNode
{
    public:
        vector<trieNode*> children;
    bool isTerminal;
    bool vis;

    trieNode(): children(26, NULL), isTerminal(false), vis(false) {}
};

class Solution
{
    public:
        int cnt = 0;
        unordered_map<string,int> mp;
    void insert(string s, trieNode *root)
    {
        trieNode *curr = root;
        int n = s.length();
        reverse(s.begin(), s.end());

        for (auto ch: s)
        {
            int idx = ch - 'a';
            if (curr->children[idx] == NULL)
                curr->children[idx] = new trieNode();

            curr = curr->children[idx];
        }

        curr->isTerminal = true;
    }

    void countSearch(string s, trieNode *root)
    {
        trieNode *temp = root;
        bool found = false;
        reverse(s.begin(), s.end());

        for (auto ch: s)
        {
            int idx = ch - 'a';
            if (temp->children[idx] != NULL)
                {
                    temp->vis=true;
                    temp = temp->children[idx];}
        }

        for(char c='a';c<='z';c++)
        {
            if(temp->children[c-'a']!=NULL)
            {
                found=true;
                break;
            }
        }
        
        if(mp.find(s)==mp.end())
        {
            if(!found) cnt+=s.length()+1;
            mp[s]++;
        }
    }

    int minimumLengthEncoding(vector<string> &words)
    {
        trieNode* root = new trieNode();

        for(auto it: words)
        insert(it,root);

        for(auto it: words)
        countSearch(it,root);

        return cnt;
    }
};
89261