title: How to find Longest Common Substring using C++
body: <p>I searched online for a C++ Longest Common Substring implementation but failed to find a decent one. I need a LCS algorithm that returns the substring itself, so it's not just LCS.</p>
  
  <p>I was wondering, though, about how I can do this between multiple strings.</p>
  
  <p>My idea was to check the longest one between 2 strings, and then go check all the others, but this is a very slow process which requires managing many long strings on the memory, making my program quite slow.</p>
  
  <p>Any idea of how this can be speeded up for multiple strings? Thank you.</p>
  
  <p><strong>Important Edit</strong>
  One of the variables I'm given determines the number of strings the longest common substring needs to be in, so I can be given 10 strings, and find the LCS of them all (K=10), or LCS of 4 of them, but I'm not told which 4, I have to find the best 4.</p>