Problem Brief

Find Longest Subsequence Common to X as Substring in Y (MLE :)

NEW GRADOA

Given two strings x and y, find the longest subsequence of x that is also a substring of y. Return the maximum length of such a subsequence.

1Example 1

Input

x = "hackerranks", y = "hackers"

Output

Explanation

The entire string "hackers" is a substring of y and also a subsequence of x (characters appear in order). The maximum length is 7.

Draft autosaves locally

public int findLongestSubsequenceCommonToXAsSubstringInY(String x, String y) {
  // write your code here
}

Input

"hackerranks"

"hackers"

Output