boolean check(wordA, wordB) {

       if(wordA.length() != wordB.length() + 1) return false;

       int i = 0, j = 0;

       while(i < wordA.length()) {

           if(j< wordB.length() && wordA[i] == wordB[j]){

               i++;

               j++;

           } else i++;

       }

       return i == wordA.length() && j == wordB.length();

}


for (i = 0; i < words.size(); i++) {

  L[i] = 1;

  for (i = 0; i < words.size(); i++) {

       if (check(words[i], words[j]) && (L[i] < L[j]+1)

           L[i] = L[j] + 1;

  }

}

return L[words.size() - 1]