Longest Common Subsequence (LCS)

Problem Given two strings text1 and text2, return the length of their longest common subsequence*.* If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be...