15:{"metadata":[["$","title","0",{"children":"Common Subsequence (#1774) - Basecamp"}],["$","meta","1",{"name":"description","content":"A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x_1, x_2, ..., x_m > another sequence Z = < z_1, z_2, ..., z_k > is a subsequence of X if there exists a strictly increasing sequence < i_1, i_2, ..., i_k > of indices of X such that for all j = 1, 2, ..., k, x_ij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y."}],["$","meta","2",{"property":"og:title","content":"Common Subsequence"}],["$","meta","3",{"property":"og:description","content":"A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x_1, x_2, ..., x_m > another sequence Z = < z_1, z_2, ..., z_k > is a subsequence of X if there exists a strictly increasing sequence < i_1, i_2, ..., i_k > of indices of X such that for all j = 1, 2, ..., k, x_ij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y."}],["$","meta","4",{"name":"twitter:card","content":"summary"}],["$","meta","5",{"name":"twitter:title","content":"Common Subsequence"}],["$","meta","6",{"name":"twitter:description","content":"A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x_1, x_2, ..., x_m > another sequence Z = < z_1, z_2, ..., z_k > is a subsequence of X if there exists a strictly increasing sequence < i_1, i_2, ..., i_k > of indices of X such that for all j = 1, 2, ..., k, x_ij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y."}]],"error":null,"digest":"$undefined"}