title: Find string made up of maximum number of other strings
body: <p>Given an array of strings, find the string which is made up of maximum number of other
  strings contained in the same array.</p>
  
  <pre><code>&gt; e.g. “rat”, ”cat”, “abc”, “xyz”, “abcxyz”, “ratcatabc”, “xyzcatratabc”
  &gt; 
  &gt; Answer: “xyzcatratabc”
  &gt; 
  &gt; “abcxyz” contains 2 other strings,
  &gt; 
  &gt; “ratcatabc” contains 3 other strings,
  &gt; 
  &gt; “xyzcatratabc” contains 4 other strings
  </code></pre>
  
  <p><strong>I have come up with a O(n* ( Avgg_length_of_string^2 ) ) solution , employing DP.</strong></p>
  
  <p><strong>Make up al possible breaks at every possible substring of a string, and check for maximality</strong>. <strong>Memoizing will give us the required complexity.</strong></p>
  
  <p>Is there any other <strong>Optimal(time bound)</strong> way to solve this.</p>