If in the longest common subsequence problem, I am only interested in the length of the longest common subsequence, not the actual subsequence, can you reduce the space complexity of O(mn) (because of matrix DP) to O(m+n)? If so, state your solution and write pseudocode. Otherwise say why.