title: Python - Longest word chain sequence from list of given words
body: <p>In the longest word chain problem - </p>
  
  <blockquote>
    <p>Make a longest word chain from given word set so that the subsequent
    word is starting from last character of preceding word.</p>
  </blockquote>
  
  <p>I am confused with the algorithm which matches with the following problem, tried Levenshtein distance but it is not what is required in the problem. Any help will be appreciated to suggest the algorithm or any links to provide more information.</p>