{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003c!DOCTYPE html\u003e\n\u003chtml\u003e\n\u003chead\u003e\n\t\u003ctitle\u003e\u003c/title\u003e\n\u003c/head\u003e\n\u003cbody\u003e\n\u003cb\u003eProblem Statement\u003c/b\u003e\n\u003cp\u003eGiven two sequence X \u0026 Y , Find the longest common subsequence.\u003c/p\u003e "}},{"title":"","value":{"format":"HTML","content":"\u003cb\u003e INPUT \u003c/b\u003e\u003cbr\u003e\nThe input consists of multiple test case. In the first line, an integer q which is the number of test cases is given. In the following 2×q lines, each case which consists of the two sequences X and Y are given.\n\u003cb\u003e\u003ci\u003e Maximum length of a sequence is 1000 \u003c/b\u003e\u003c/i\u003e"}},{"title":"","value":{"format":"HTML","content":"\u003cb\u003e OUTPUT \u003c/b\u003e\u003cbr\u003e\nprint the length of LCS of X and Y in a line.\n"}},{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\u003cb\u003eSample Input \u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e\n3 \u003cbr\u003e\nabcbdab bdcaba \u003cbr\u003e\nabc abc \u003cbr\u003e\nabc bc \u003cbr\u003e\n\u003c/p\u003e\n\n\u003cp\u003e\u003cb\u003eSample Output\u003c/b\u003e\u003c/p\u003e\n\u003cp\u003e4\u003c/p\u003e\n\u003cp\u003e3\u003c/p\u003e\n\u003cp\u003e2\u003c/p\u003e\n\n\u003c/body\u003e\n\u003c/html\u003e"}}]}