title: longest common subsequence with linear memory usage
body: <p>I'm trying to find an algorithm which uses linear space of memory for:</p>
  
  <p>Given two strings x and y over an arbitrary alphabet, determine their longest common sub sequence.</p>