Subsequence of strings
<p>I implemented a python function that returns the longest common subsequence of 2 strings. Now, I'd like to implement a function that returns the longest common subsequence of any number of strings.</p>

<p>I found this help for 3 strings:</p>

<pre><code>dp[i, j, k] = / 1 + dp[i - 1, j - 1, k - 1] if A[i] = B[j] = C[k]
              \ max(dp[i - 1, j, k], dp[i, j - 1, k], dp[i, j, k - 1]) otherwise
</code></pre>

<p>But I don't really understand this hint.
So, I'd be thankful if anybody could help me.
Best regards, Mark</p>
