<p>You are given an array of <code>words</code> where each word consists of lowercase English letters.</p>

<p><code>word<sub>A</sub></code> is a <strong>predecessor</strong> of <code>word<sub>B</sub></code> if and only if we can insert <strong>exactly one</strong> letter anywhere in <code>word<sub>A</sub></code> <strong>without changing the order of the other characters</strong> to make it equal to <code>word<sub>B</sub></code>.</p>

<ul>
	<li>For example, <code>&quot;abc&quot;</code> is a <strong>predecessor</strong> of <code>&quot;ab<u>a</u>c&quot;</code>, while <code>&quot;cba&quot;</code> is not a <strong>predecessor</strong> of <code>&quot;bcad&quot;</code>.</li>
</ul>

<p>A <strong>word chain</strong><em> </em>is a sequence of words <code>[word<sub>1</sub>, word<sub>2</sub>, ..., word<sub>k</sub>]</code> with <code>k &gt;= 1</code>, where <code>word<sub>1</sub></code> is a <strong>predecessor</strong> of <code>word<sub>2</sub></code>, <code>word<sub>2</sub></code> is a <strong>predecessor</strong> of <code>word<sub>3</sub></code>, and so on. A single word is trivially a <strong>word chain</strong> with <code>k == 1</code>.</p>

<p>Return <em>the <strong>length</strong> of the <strong>longest possible word chain</strong> with words chosen from the given list of </em><code>words</code>.</p>

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

<pre>
<strong>Input:</strong> words = [&quot;a&quot;,&quot;b&quot;,&quot;ba&quot;,&quot;bca&quot;,&quot;bda&quot;,&quot;bdca&quot;]
<strong>Output:</strong> 4
<strong>Explanation</strong>: One of the longest word chains is [&quot;a&quot;,&quot;<u>b</u>a&quot;,&quot;b<u>d</u>a&quot;,&quot;bd<u>c</u>a&quot;].
</pre>

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

<pre>
<strong>Input:</strong> words = [&quot;xbc&quot;,&quot;pcxbcf&quot;,&quot;xb&quot;,&quot;cxbc&quot;,&quot;pcxbc&quot;]
<strong>Output:</strong> 5
<strong>Explanation:</strong> All the words can be put in a word chain [&quot;xb&quot;, &quot;xb<u>c</u>&quot;, &quot;<u>c</u>xbc&quot;, &quot;<u>p</u>cxbc&quot;, &quot;pcxbc<u>f</u>&quot;].
</pre>

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

<pre>
<strong>Input:</strong> words = [&quot;abcd&quot;,&quot;dbqca&quot;]
<strong>Output:</strong> 1
<strong>Explanation:</strong> The trivial word chain [&quot;abcd&quot;] is one of the longest word chains.
[&quot;abcd&quot;,&quot;dbqca&quot;] is not a valid word chain because the ordering of the letters is changed.
</pre>

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

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

class Solution {
public:
    int lcs(string t1, string t2) {
        int n = t1.length();
        int m= t2.length();
        if(n==0||m==0) return 0;
        vector<vector<int>>dp(n+1,vector<int>(m+1));
        for(int i =0;i<=n;i++)
        {
            dp[i][0]=0;
        }
        for(int i =0;i<=m;i++)
        {
            dp[0][i]=0;
        }
        for(int i =1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                if(t1[i-1]==t2[j-1]) dp[i][j]=1+dp[i-1][j-1];
                else dp[i][j]= max(dp[i-1][j],dp[i][j-1]);
            }
        }
        return dp[n][m];
    }
   static int asciiSum(const string& str) {
    int sum = 0;
    for (char ch : str) {
        sum += static_cast<int>(ch);
    }
    return sum;
}

// Custom comparator function
static bool compare(const string& a, const string& b) {
    return asciiSum(a) < asciiSum(b);
}
    int longestStrChain(vector<string>& words) {
       sort(words.begin(),words.end(),compare);
       int n = words.size();
    //    map<string,int> mp;
    //    for(int i =0;i<n;i++)
    //    {
    //     for()
    //    }
      
       int lis[n];
       lis[0]=1;
       for(int i =1;i<n;i++)
       { 
        lis[i]=1;
        for(int j =0;j<i;j++)
        {
           if((words[i].length()-words[j].length())==1)
           {
              if(lcs(words[i],words[j])==words[j].length())
              {
                lis[i]= max(lis[i],lis[j]+1);
              }
           }
        }
         
       }
       int res = lis[0];
        for(int i =0;i<n;i++)
        {
            res= max(res,lis[i]);
        }
        return res;
    }
};
471484