package leetcode;

/**
 * https://leetcode.com/problems/longest-common-subsequence/
 */
public class Problem1143 {
    public int longestCommonSubsequence(String text1, String text2) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1143 prob = new Problem1143();
        System.out.println(prob.longestCommonSubsequence("abcde", "ace")); // 3
        System.out.println(prob.longestCommonSubsequence("abc", "abc")); // 3
        System.out.println(prob.longestCommonSubsequence("abc", "def")); // 0
    }
}

@@ -382,32 +382,112 @@
 , %22ace%22)); // 3%0A
+        System.out.println(prob.longestCommonSubsequence(%22ace%22, %22abcde%22)); // 3%0A
         System.o

Update problem 1143