/string-manipulation-exercises

Primary LanguageJava

Function to return the longest common subsequence of Strings s1 and s2

  1. Longest common subsequence refers to the longest sequence of characters that appear in both strings
  2. The characters are case sensitive
  3. Its advisable to come up with test cases in pseudocode or just English
  4. The order of the characters must be maintained

algorithm reference

reference function