Design a dynamic programming algorithm for the Longest Common Subsequence problem discussed in class. Given two input strings of lower case letters, determine the Longest Common Subsequence of the sequences they represent.
Deliverable:
Source code for a single class, LCS.java with the method described below. Submit on PolyLearn.
Your Class, LCS.java, must meet the following specifications:
• Implement a static method getLCS (String str1, String str2) that returns a String containing a longest common subsequence of the two sequences represented by str1 and str2. If there is more than one subsequence that is “longest” just return one that you have found. Do not pad your string representation of the longest common subsequence with any additional characters or spaces.
2/20/2019 Week 7 Lab LongestCommonSubSeq.docx 1
